/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:44:22,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:44:22,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:44:22,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:44:22,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:44:22,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:44:22,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:44:22,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:44:22,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:44:22,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:44:22,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:44:22,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:44:22,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:44:22,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:44:22,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:44:22,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:44:22,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:44:22,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:44:22,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:44:22,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:44:22,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:44:22,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:44:22,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:44:22,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:44:22,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:44:22,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:44:22,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:44:22,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:44:22,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:44:22,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:44:22,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:44:22,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:44:22,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:44:22,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:44:22,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:44:22,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:44:22,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:44:22,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:44:22,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:44:22,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:44:22,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:44:22,144 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:44:22,159 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:44:22,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:44:22,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:44:22,160 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:44:22,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:44:22,160 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:44:22,161 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:44:22,161 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:44:22,161 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:44:22,161 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:44:22,161 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:44:22,161 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:44:22,162 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:44:22,162 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:44:22,162 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:44:22,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:44:22,162 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:44:22,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:44:22,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:44:22,163 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:44:22,163 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:44:22,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:44:22,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:44:22,164 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:44:22,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:44:22,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:44:22,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:44:22,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:44:22,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:44:22,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:44:22,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:44:22,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:44:22,347 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:44:22,348 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:44:22,348 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:44:22,444 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_6vEmVO/tmp/beaf6cb65221431992f6c54173a0ace5/FLAGa67f0d359 [2020-07-01 12:44:22,774 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:44:22,774 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:44:22,775 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:44:22,781 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_6vEmVO/tmp/beaf6cb65221431992f6c54173a0ace5/FLAGa67f0d359 [2020-07-01 12:44:23,184 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_6vEmVO/tmp/beaf6cb65221431992f6c54173a0ace5 [2020-07-01 12:44:23,195 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:44:23,196 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:44:23,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:44:23,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:44:23,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:44:23,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ea16ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23, skipping insertion in model container [2020-07-01 12:44:23,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:44:23,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:44:23,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:44:23,475 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:44:23,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:44:23,509 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:44:23,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23 WrapperNode [2020-07-01 12:44:23,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:44:23,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:44:23,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:44:23,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:44:23,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:44:23,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:44:23,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:44:23,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:44:23,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:44:23,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:44:23,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:44:23,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:44:23,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:44:23,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:44:23,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:44:23,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:44:23,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:44:23,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:44:23,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:44:24,039 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:44:24,039 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 12:44:24,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:44:24 BoogieIcfgContainer [2020-07-01 12:44:24,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:44:24,045 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:44:24,045 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:44:24,047 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:44:24,048 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:44:24" (1/1) ... [2020-07-01 12:44:24,064 INFO L313 BlockEncoder]: Initial Icfg 72 locations, 74 edges [2020-07-01 12:44:24,066 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:44:24,066 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:44:24,067 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:44:24,067 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:44:24,069 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:44:24,070 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:44:24,070 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:44:24,100 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:44:24,108 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2020-07-01 12:44:24,200 INFO L200 BlockEncoder]: SBE split 39 edges [2020-07-01 12:44:24,207 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:44:24,209 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:44:24,258 INFO L100 BaseMinimizeStates]: Removed 20 edges and 10 locations by large block encoding [2020-07-01 12:44:24,261 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:44:24,263 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:44:24,264 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:44:24,267 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-07-01 12:44:24,268 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:44:24,269 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:44:24,269 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:44:24,270 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:44:24,270 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:44:24,271 INFO L313 BlockEncoder]: Encoded RCFG 60 locations, 226 edges [2020-07-01 12:44:24,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:44:24 BasicIcfg [2020-07-01 12:44:24,272 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:44:24,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:44:24,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:44:24,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:44:24,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:44:23" (1/4) ... [2020-07-01 12:44:24,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1caa637d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:44:24, skipping insertion in model container [2020-07-01 12:44:24,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (2/4) ... [2020-07-01 12:44:24,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1caa637d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:44:24, skipping insertion in model container [2020-07-01 12:44:24,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:44:24" (3/4) ... [2020-07-01 12:44:24,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1caa637d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:44:24, skipping insertion in model container [2020-07-01 12:44:24,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:44:24" (4/4) ... [2020-07-01 12:44:24,281 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:44:24,292 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:44:24,300 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2020-07-01 12:44:24,314 INFO L251 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2020-07-01 12:44:24,339 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:44:24,339 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:44:24,340 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:44:24,340 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:44:24,340 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:44:24,340 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:44:24,340 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:44:24,340 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:44:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2020-07-01 12:44:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:44:24,364 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:24,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:44:24,365 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:24,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:24,371 INFO L82 PathProgramCache]: Analyzing trace with hash 152418, now seen corresponding path program 1 times [2020-07-01 12:44:24,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:24,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847602847] [2020-07-01 12:44:24,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:24,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847602847] [2020-07-01 12:44:24,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:24,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:24,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151422410] [2020-07-01 12:44:24,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:24,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:24,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:24,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:24,584 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2020-07-01 12:44:25,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:25,146 INFO L93 Difference]: Finished difference Result 118 states and 323 transitions. [2020-07-01 12:44:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:25,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:44:25,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:25,161 INFO L225 Difference]: With dead ends: 118 [2020-07-01 12:44:25,161 INFO L226 Difference]: Without dead ends: 60 [2020-07-01 12:44:25,165 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:25,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-01 12:44:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-07-01 12:44:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-01 12:44:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 99 transitions. [2020-07-01 12:44:25,207 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 99 transitions. Word has length 3 [2020-07-01 12:44:25,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:25,207 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 99 transitions. [2020-07-01 12:44:25,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 99 transitions. [2020-07-01 12:44:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:44:25,208 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:25,208 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:44:25,210 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:44:25,210 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:25,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:25,211 INFO L82 PathProgramCache]: Analyzing trace with hash 153565, now seen corresponding path program 1 times [2020-07-01 12:44:25,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:25,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335257922] [2020-07-01 12:44:25,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:25,305 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335257922] [2020-07-01 12:44:25,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:25,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:25,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203426926] [2020-07-01 12:44:25,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:25,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:25,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:25,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:25,308 INFO L87 Difference]: Start difference. First operand 60 states and 99 transitions. Second operand 3 states. [2020-07-01 12:44:25,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:25,478 INFO L93 Difference]: Finished difference Result 60 states and 99 transitions. [2020-07-01 12:44:25,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:25,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:44:25,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:25,480 INFO L225 Difference]: With dead ends: 60 [2020-07-01 12:44:25,481 INFO L226 Difference]: Without dead ends: 56 [2020-07-01 12:44:25,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:25,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-01 12:44:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-01 12:44:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-01 12:44:25,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 91 transitions. [2020-07-01 12:44:25,488 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 91 transitions. Word has length 3 [2020-07-01 12:44:25,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:25,489 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 91 transitions. [2020-07-01 12:44:25,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:25,489 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 91 transitions. [2020-07-01 12:44:25,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:44:25,489 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:25,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:44:25,490 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:44:25,490 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:25,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:25,490 INFO L82 PathProgramCache]: Analyzing trace with hash 153567, now seen corresponding path program 1 times [2020-07-01 12:44:25,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:25,491 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119008399] [2020-07-01 12:44:25,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:25,531 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119008399] [2020-07-01 12:44:25,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:25,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:25,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672222767] [2020-07-01 12:44:25,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:25,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:25,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:25,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:25,533 INFO L87 Difference]: Start difference. First operand 56 states and 91 transitions. Second operand 3 states. [2020-07-01 12:44:25,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:25,643 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2020-07-01 12:44:25,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:25,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:44:25,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:25,645 INFO L225 Difference]: With dead ends: 60 [2020-07-01 12:44:25,645 INFO L226 Difference]: Without dead ends: 56 [2020-07-01 12:44:25,646 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:25,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-01 12:44:25,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-01 12:44:25,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-01 12:44:25,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 87 transitions. [2020-07-01 12:44:25,652 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 87 transitions. Word has length 3 [2020-07-01 12:44:25,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:25,652 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 87 transitions. [2020-07-01 12:44:25,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:25,652 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 87 transitions. [2020-07-01 12:44:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:44:25,653 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:25,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:44:25,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:44:25,653 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:25,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:25,653 INFO L82 PathProgramCache]: Analyzing trace with hash 153568, now seen corresponding path program 1 times [2020-07-01 12:44:25,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:25,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868367379] [2020-07-01 12:44:25,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:25,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868367379] [2020-07-01 12:44:25,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:25,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:25,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009799032] [2020-07-01 12:44:25,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:25,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:25,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:25,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:25,725 INFO L87 Difference]: Start difference. First operand 56 states and 87 transitions. Second operand 3 states. [2020-07-01 12:44:25,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:25,863 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2020-07-01 12:44:25,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:25,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:44:25,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:25,865 INFO L225 Difference]: With dead ends: 56 [2020-07-01 12:44:25,865 INFO L226 Difference]: Without dead ends: 52 [2020-07-01 12:44:25,865 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-01 12:44:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-01 12:44:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-01 12:44:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 83 transitions. [2020-07-01 12:44:25,871 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 83 transitions. Word has length 3 [2020-07-01 12:44:25,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:25,871 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 83 transitions. [2020-07-01 12:44:25,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 83 transitions. [2020-07-01 12:44:25,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:44:25,872 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:25,872 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:44:25,872 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:44:25,872 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:25,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:25,873 INFO L82 PathProgramCache]: Analyzing trace with hash 4754279, now seen corresponding path program 1 times [2020-07-01 12:44:25,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:25,873 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237133951] [2020-07-01 12:44:25,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:25,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237133951] [2020-07-01 12:44:25,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:25,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:44:25,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001980997] [2020-07-01 12:44:25,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:44:25,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:25,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:44:25,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:44:25,964 INFO L87 Difference]: Start difference. First operand 52 states and 83 transitions. Second operand 4 states. [2020-07-01 12:44:26,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:26,097 INFO L93 Difference]: Finished difference Result 52 states and 83 transitions. [2020-07-01 12:44:26,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:26,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-07-01 12:44:26,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:26,099 INFO L225 Difference]: With dead ends: 52 [2020-07-01 12:44:26,099 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 12:44:26,099 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:44:26,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 12:44:26,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-01 12:44:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-01 12:44:26,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 81 transitions. [2020-07-01 12:44:26,105 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 81 transitions. Word has length 4 [2020-07-01 12:44:26,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:26,105 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 81 transitions. [2020-07-01 12:44:26,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:44:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 81 transitions. [2020-07-01 12:44:26,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:44:26,106 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:26,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:44:26,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:44:26,106 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:26,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:26,107 INFO L82 PathProgramCache]: Analyzing trace with hash 4754281, now seen corresponding path program 1 times [2020-07-01 12:44:26,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:26,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203149678] [2020-07-01 12:44:26,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:26,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:26,135 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203149678] [2020-07-01 12:44:26,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:26,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:26,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116297347] [2020-07-01 12:44:26,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:26,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:26,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:26,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:26,136 INFO L87 Difference]: Start difference. First operand 51 states and 81 transitions. Second operand 3 states. [2020-07-01 12:44:26,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:26,230 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2020-07-01 12:44:26,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:26,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:44:26,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:26,231 INFO L225 Difference]: With dead ends: 52 [2020-07-01 12:44:26,231 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 12:44:26,232 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 12:44:26,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-01 12:44:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-01 12:44:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 80 transitions. [2020-07-01 12:44:26,236 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 80 transitions. Word has length 4 [2020-07-01 12:44:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:26,236 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 80 transitions. [2020-07-01 12:44:26,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 80 transitions. [2020-07-01 12:44:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:44:26,237 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:26,237 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:44:26,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:44:26,238 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:26,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:26,238 INFO L82 PathProgramCache]: Analyzing trace with hash 4754282, now seen corresponding path program 1 times [2020-07-01 12:44:26,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:26,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601417282] [2020-07-01 12:44:26,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:26,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601417282] [2020-07-01 12:44:26,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:26,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:26,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313322545] [2020-07-01 12:44:26,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:26,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:26,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:26,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:26,292 INFO L87 Difference]: Start difference. First operand 51 states and 80 transitions. Second operand 3 states. [2020-07-01 12:44:26,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:26,416 INFO L93 Difference]: Finished difference Result 51 states and 80 transitions. [2020-07-01 12:44:26,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:26,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:44:26,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:26,418 INFO L225 Difference]: With dead ends: 51 [2020-07-01 12:44:26,418 INFO L226 Difference]: Without dead ends: 50 [2020-07-01 12:44:26,418 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-01 12:44:26,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-01 12:44:26,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-01 12:44:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 79 transitions. [2020-07-01 12:44:26,423 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 79 transitions. Word has length 4 [2020-07-01 12:44:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:26,423 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 79 transitions. [2020-07-01 12:44:26,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 79 transitions. [2020-07-01 12:44:26,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:44:26,424 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:26,424 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:44:26,424 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:44:26,424 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:26,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:26,424 INFO L82 PathProgramCache]: Analyzing trace with hash 147385221, now seen corresponding path program 1 times [2020-07-01 12:44:26,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:26,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452340019] [2020-07-01 12:44:26,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:26,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452340019] [2020-07-01 12:44:26,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:26,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:26,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319644701] [2020-07-01 12:44:26,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:26,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:26,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:26,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:26,461 INFO L87 Difference]: Start difference. First operand 50 states and 79 transitions. Second operand 3 states. [2020-07-01 12:44:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:26,572 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2020-07-01 12:44:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:26,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:44:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:26,574 INFO L225 Difference]: With dead ends: 50 [2020-07-01 12:44:26,574 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 12:44:26,574 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:26,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 12:44:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-01 12:44:26,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-01 12:44:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 71 transitions. [2020-07-01 12:44:26,578 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 71 transitions. Word has length 5 [2020-07-01 12:44:26,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:26,579 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 71 transitions. [2020-07-01 12:44:26,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:26,579 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 71 transitions. [2020-07-01 12:44:26,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:44:26,579 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:26,579 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:44:26,580 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:44:26,580 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:26,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:26,580 INFO L82 PathProgramCache]: Analyzing trace with hash 147385223, now seen corresponding path program 1 times [2020-07-01 12:44:26,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:26,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356842835] [2020-07-01 12:44:26,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:26,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356842835] [2020-07-01 12:44:26,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:26,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:26,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140167068] [2020-07-01 12:44:26,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:26,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:26,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:26,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:26,619 INFO L87 Difference]: Start difference. First operand 46 states and 71 transitions. Second operand 3 states. [2020-07-01 12:44:26,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:26,716 INFO L93 Difference]: Finished difference Result 46 states and 71 transitions. [2020-07-01 12:44:26,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:26,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:44:26,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:26,718 INFO L225 Difference]: With dead ends: 46 [2020-07-01 12:44:26,718 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:44:26,719 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:44:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-01 12:44:26,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 12:44:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 63 transitions. [2020-07-01 12:44:26,722 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 63 transitions. Word has length 5 [2020-07-01 12:44:26,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:26,723 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 63 transitions. [2020-07-01 12:44:26,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 63 transitions. [2020-07-01 12:44:26,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:44:26,723 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:26,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:44:26,724 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:44:26,724 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:26,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:26,724 INFO L82 PathProgramCache]: Analyzing trace with hash 273968854, now seen corresponding path program 1 times [2020-07-01 12:44:26,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:26,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851236508] [2020-07-01 12:44:26,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:26,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851236508] [2020-07-01 12:44:26,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:26,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:44:26,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393105408] [2020-07-01 12:44:26,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:44:26,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:26,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:44:26,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:44:26,784 INFO L87 Difference]: Start difference. First operand 42 states and 63 transitions. Second operand 4 states. [2020-07-01 12:44:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:26,860 INFO L93 Difference]: Finished difference Result 42 states and 63 transitions. [2020-07-01 12:44:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:26,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 12:44:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:26,861 INFO L225 Difference]: With dead ends: 42 [2020-07-01 12:44:26,861 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 12:44:26,862 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:44:26,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 12:44:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 12:44:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 12:44:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2020-07-01 12:44:26,865 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 6 [2020-07-01 12:44:26,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:26,866 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2020-07-01 12:44:26,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:44:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2020-07-01 12:44:26,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:44:26,866 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:26,866 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:44:26,867 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:44:26,867 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:26,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:26,867 INFO L82 PathProgramCache]: Analyzing trace with hash 273968856, now seen corresponding path program 1 times [2020-07-01 12:44:26,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:26,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72834073] [2020-07-01 12:44:26,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:26,922 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72834073] [2020-07-01 12:44:26,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:26,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:26,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361855491] [2020-07-01 12:44:26,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:26,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:26,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:26,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:26,924 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 3 states. [2020-07-01 12:44:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:27,004 INFO L93 Difference]: Finished difference Result 41 states and 61 transitions. [2020-07-01 12:44:27,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:27,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:44:27,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:27,005 INFO L225 Difference]: With dead ends: 41 [2020-07-01 12:44:27,005 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 12:44:27,006 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 12:44:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-01 12:44:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 12:44:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2020-07-01 12:44:27,010 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 6 [2020-07-01 12:44:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:27,010 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-07-01 12:44:27,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2020-07-01 12:44:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:44:27,011 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:27,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:27,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:44:27,011 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:27,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:27,012 INFO L82 PathProgramCache]: Analyzing trace with hash -96897755, now seen corresponding path program 1 times [2020-07-01 12:44:27,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:27,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812899199] [2020-07-01 12:44:27,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:27,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:27,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812899199] [2020-07-01 12:44:27,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:27,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:27,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768424738] [2020-07-01 12:44:27,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:27,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:27,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:27,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,044 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 3 states. [2020-07-01 12:44:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:27,128 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2020-07-01 12:44:27,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:27,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:44:27,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:27,129 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:44:27,129 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 12:44:27,130 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 12:44:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 12:44:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 12:44:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2020-07-01 12:44:27,133 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 7 [2020-07-01 12:44:27,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:27,133 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2020-07-01 12:44:27,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:27,134 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2020-07-01 12:44:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:44:27,134 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:27,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:27,134 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 12:44:27,135 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:27,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:27,135 INFO L82 PathProgramCache]: Analyzing trace with hash -96897753, now seen corresponding path program 1 times [2020-07-01 12:44:27,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:27,135 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713953280] [2020-07-01 12:44:27,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:27,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713953280] [2020-07-01 12:44:27,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:27,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:27,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462915448] [2020-07-01 12:44:27,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:27,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:27,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:27,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,165 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2020-07-01 12:44:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:27,214 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2020-07-01 12:44:27,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:27,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:44:27,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:27,215 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:44:27,215 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 12:44:27,216 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 12:44:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 12:44:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 12:44:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2020-07-01 12:44:27,218 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 7 [2020-07-01 12:44:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:27,219 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-07-01 12:44:27,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2020-07-01 12:44:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:44:27,219 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:27,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:27,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 12:44:27,220 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:27,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:27,220 INFO L82 PathProgramCache]: Analyzing trace with hash -96897752, now seen corresponding path program 1 times [2020-07-01 12:44:27,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:27,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452089849] [2020-07-01 12:44:27,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:27,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452089849] [2020-07-01 12:44:27,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:27,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:27,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144380045] [2020-07-01 12:44:27,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:27,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:27,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:27,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,261 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand 3 states. [2020-07-01 12:44:27,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:27,317 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2020-07-01 12:44:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:27,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:44:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:27,318 INFO L225 Difference]: With dead ends: 35 [2020-07-01 12:44:27,318 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:44:27,319 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:44:27,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 12:44:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:44:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2020-07-01 12:44:27,322 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 7 [2020-07-01 12:44:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:27,322 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-07-01 12:44:27,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2020-07-01 12:44:27,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:44:27,322 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:27,323 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:27,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 12:44:27,323 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:27,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:27,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1291131415, now seen corresponding path program 1 times [2020-07-01 12:44:27,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:27,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685025955] [2020-07-01 12:44:27,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:27,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685025955] [2020-07-01 12:44:27,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:27,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:44:27,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258787182] [2020-07-01 12:44:27,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:44:27,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:27,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:44:27,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:44:27,367 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand 4 states. [2020-07-01 12:44:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:27,418 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-07-01 12:44:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:27,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-01 12:44:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:27,419 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:44:27,419 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:44:27,419 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:44:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:44:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:44:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:44:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2020-07-01 12:44:27,422 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 8 [2020-07-01 12:44:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:27,422 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2020-07-01 12:44:27,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:44:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2020-07-01 12:44:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:44:27,423 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:27,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:27,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 12:44:27,423 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:27,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:27,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1291131417, now seen corresponding path program 1 times [2020-07-01 12:44:27,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:27,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890996457] [2020-07-01 12:44:27,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:27,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890996457] [2020-07-01 12:44:27,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:27,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:27,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862154833] [2020-07-01 12:44:27,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:27,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:27,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:27,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,452 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 3 states. [2020-07-01 12:44:27,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:27,484 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-07-01 12:44:27,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:27,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-01 12:44:27,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:27,485 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:44:27,485 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:44:27,486 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:44:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:44:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:44:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2020-07-01 12:44:27,488 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 8 [2020-07-01 12:44:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:27,489 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-07-01 12:44:27,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2020-07-01 12:44:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:44:27,489 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:27,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:27,490 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-01 12:44:27,490 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:27,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:27,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1291131418, now seen corresponding path program 1 times [2020-07-01 12:44:27,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:27,491 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217642101] [2020-07-01 12:44:27,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:27,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217642101] [2020-07-01 12:44:27,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:27,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:27,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245542215] [2020-07-01 12:44:27,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:27,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:27,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:27,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,523 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 3 states. [2020-07-01 12:44:27,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:27,573 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-07-01 12:44:27,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:27,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-01 12:44:27,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:27,574 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:44:27,574 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:44:27,575 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:44:27,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:44:27,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:44:27,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-07-01 12:44:27,577 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 8 [2020-07-01 12:44:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:27,577 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-01 12:44:27,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-01 12:44:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 12:44:27,578 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:27,578 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:27,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-01 12:44:27,579 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:27,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:27,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1370370355, now seen corresponding path program 1 times [2020-07-01 12:44:27,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:27,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969752285] [2020-07-01 12:44:27,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:27,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969752285] [2020-07-01 12:44:27,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:27,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:27,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100967038] [2020-07-01 12:44:27,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:27,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:27,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:27,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,605 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 3 states. [2020-07-01 12:44:27,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:27,653 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-01 12:44:27,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:27,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-07-01 12:44:27,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:27,654 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:44:27,655 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 12:44:27,655 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 12:44:27,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 12:44:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:44:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-01 12:44:27,657 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2020-07-01 12:44:27,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:27,657 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-01 12:44:27,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-01 12:44:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 12:44:27,658 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:27,658 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:27,658 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-01 12:44:27,659 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:27,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1370370357, now seen corresponding path program 1 times [2020-07-01 12:44:27,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:27,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769636266] [2020-07-01 12:44:27,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:27,691 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769636266] [2020-07-01 12:44:27,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:27,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:27,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10375874] [2020-07-01 12:44:27,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:27,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:27,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:27,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,693 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 3 states. [2020-07-01 12:44:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:27,737 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-01 12:44:27,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:27,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-07-01 12:44:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:27,738 INFO L225 Difference]: With dead ends: 25 [2020-07-01 12:44:27,738 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:44:27,738 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:44:27,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:44:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:44:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:44:27,739 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2020-07-01 12:44:27,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:27,740 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:44:27,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:44:27,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:44:27,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-01 12:44:27,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:44:27,822 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 12:44:27,822 INFO L268 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-07-01 12:44:27,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:44:27,823 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:44:27,823 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 12:44:27,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:44:27,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:44:27,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:44:27,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:44:27,823 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:44:27,823 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:44:27,824 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:44:27,824 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:44:27,824 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:44:27,824 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:44:27,824 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:44:27,824 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:44:27,824 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:44:27,824 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 12:44:27,824 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-01 12:44:27,825 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:44:27,825 INFO L268 CegarLoopResult]: For program point L20-2(line 20) no Hoare annotation was computed. [2020-07-01 12:44:27,825 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:44:27,825 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 12:44:27,825 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:44:27,825 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:44:27,825 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:44:27,825 INFO L268 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-07-01 12:44:27,825 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:44:27,825 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:44:27,826 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:44:27,826 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:44:27,826 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 12:44:27,826 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:44:27,826 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 12:44:27,826 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:44:27,826 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:44:27,826 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:44:27,826 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:44:27,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:44:27,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:44:27,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:44:27,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:44:27,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:44:27,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:44:27,827 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-01 12:44:27,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:44:27,827 INFO L268 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-07-01 12:44:27,827 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:44:27,828 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 12:44:27,828 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:44:27,828 INFO L268 CegarLoopResult]: For program point L18-1(lines 18 23) no Hoare annotation was computed. [2020-07-01 12:44:27,828 INFO L264 CegarLoopResult]: At program point L18-3(lines 14 24) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~z~0.base)) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= (select |#valid| ULTIMATE.start_main_~w~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_main_~u~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~z~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~c~0.base)) (= (select |#length| ULTIMATE.start_main_~x~0.base) 4) (<= 1 |#StackHeapBarrier|) (= 0 ULTIMATE.start_main_~c~0.offset) (= 4 (select |#length| ULTIMATE.start_main_~v~0.base)) (= (select |#valid| ULTIMATE.start_main_~v~0.base) 1) (= 4 (select |#length| ULTIMATE.start_main_~w~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~y~0.base)) (= 0 ULTIMATE.start_main_~z~0.offset) (= 0 ULTIMATE.start_main_~y~0.offset) (= 0 ULTIMATE.start_main_~v~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~y~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~c~0.base)) (= 0 ULTIMATE.start_main_~x~0.offset) (= 0 ULTIMATE.start_main_~w~0.offset) (= 4 (select |#length| ULTIMATE.start_main_~u~0.base)) (= 0 ULTIMATE.start_main_~u~0.offset)) [2020-07-01 12:44:27,829 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:44:27,829 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:44:27,829 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:44:27,829 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:44:27,829 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:44:27,829 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:44:27,829 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:44:27,832 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:44:27,844 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:27,845 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:27,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:27,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:44:27,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:27,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:27,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:27,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:27,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:27,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:27,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:27,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:44:27,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:27,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:27,857 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:27,857 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:27,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:44:27 BasicIcfg [2020-07-01 12:44:27,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:44:27,860 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:44:27,861 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:44:27,864 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:44:27,865 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:44:27,865 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:44:23" (1/5) ... [2020-07-01 12:44:27,865 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43a55e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:44:27, skipping insertion in model container [2020-07-01 12:44:27,866 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:44:27,866 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (2/5) ... [2020-07-01 12:44:27,866 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43a55e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:44:27, skipping insertion in model container [2020-07-01 12:44:27,866 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:44:27,866 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:44:24" (3/5) ... [2020-07-01 12:44:27,867 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43a55e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:44:27, skipping insertion in model container [2020-07-01 12:44:27,867 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:44:27,867 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:44:24" (4/5) ... [2020-07-01 12:44:27,867 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43a55e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:44:27, skipping insertion in model container [2020-07-01 12:44:27,867 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:44:27,867 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:44:27" (5/5) ... [2020-07-01 12:44:27,869 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:44:27,892 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:44:27,892 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:44:27,892 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:44:27,892 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:44:27,892 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:44:27,892 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:44:27,892 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:44:27,892 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:44:27,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states. [2020-07-01 12:44:27,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-01 12:44:27,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:44:27,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:44:27,910 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:27,910 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:27,910 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:44:27,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states. [2020-07-01 12:44:27,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-01 12:44:27,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:44:27,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:44:27,915 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:27,915 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:27,920 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [119] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [255] L-1-->L11: Formula: (let ((.cse5 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse3 (store .cse5 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (let ((.cse1 (store .cse4 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_1| 1))) (and (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_1|)) (< 0 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~u~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~u~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_1|) 0) (= v_ULTIMATE.start_main_~v~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= v_ULTIMATE.start_main_~w~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc5.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (store (store (store (store (store (store (store |v_#length_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4) |v_ULTIMATE.start_main_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4) |v_ULTIMATE.start_main_#t~malloc5.base_1| 4) |v_ULTIMATE.start_main_#t~malloc6.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~c~0.base_1 |v_ULTIMATE.start_main_#t~malloc6.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc3.base_1|)) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_1|) (= v_ULTIMATE.start_main_~w~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= 0 (select .cse4 |v_ULTIMATE.start_main_#t~malloc4.base_1|)) (= 0 (select .cse5 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc5.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~v~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_1| 1)) (= v_ULTIMATE.start_main_~c~0.offset_1 |v_ULTIMATE.start_main_#t~malloc6.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc5.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc3.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc6.base_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc5.offset_1|)))))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~u~0.offset=v_ULTIMATE.start_main_~u~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_1, ULTIMATE.start_main_~u~0.base=v_ULTIMATE.start_main_~u~0.base_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~v~0.offset=v_ULTIMATE.start_main_~v~0.offset_1, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_1|, ULTIMATE.start_main_~v~0.base=v_ULTIMATE.start_main_~v~0.base_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_~w~0.offset=v_ULTIMATE.start_main_~w~0.offset_1, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem17=|v_ULTIMATE.start_main_#t~mem17_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_~w~0.base=v_ULTIMATE.start_main_~w~0.base_1, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~u~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~c~0.base, ULTIMATE.start_main_~u~0.base, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~c~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~v~0.offset, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~v~0.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~w~0.offset, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem17, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_~w~0.base, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~malloc5.offset] 28#L11true [120] L11-->L11-1: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~x~0.base_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_11|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 25#L11-1true [408] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_main_~u~0.offset_6 4) (select |v_#length_47| v_ULTIMATE.start_main_~u~0.base_7)) (<= 0 v_ULTIMATE.start_main_~u~0.offset_6) (= 1 (select |v_#valid_57| v_ULTIMATE.start_main_~u~0.base_7)) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~u~0.base_7 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~u~0.base_7) v_ULTIMATE.start_main_~u~0.offset_6 |v_ULTIMATE.start_main_#t~mem7_6|)) |v_#memory_int_28|)) InVars {ULTIMATE.start_main_~u~0.offset=v_ULTIMATE.start_main_~u~0.offset_6, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, ULTIMATE.start_main_~u~0.base=v_ULTIMATE.start_main_~u~0.base_7, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_29|, #length=|v_#length_47|} OutVars{ULTIMATE.start_main_~u~0.offset=v_ULTIMATE.start_main_~u~0.offset_6, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~u~0.base=v_ULTIMATE.start_main_~u~0.base_7, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_28|, #length=|v_#length_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 47#L12true [145] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_13| v_ULTIMATE.start_main_~y~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 46#L12-1true [409] L12-1-->L13: Formula: (and (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~v~0.base_7 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~v~0.base_7) v_ULTIMATE.start_main_~v~0.offset_6 |v_ULTIMATE.start_main_#t~mem8_6|)) |v_#memory_int_30|) (<= 0 v_ULTIMATE.start_main_~v~0.offset_6) (<= (+ v_ULTIMATE.start_main_~v~0.offset_6 4) (select |v_#length_48| v_ULTIMATE.start_main_~v~0.base_7)) (= 1 (select |v_#valid_58| v_ULTIMATE.start_main_~v~0.base_7))) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~v~0.offset=v_ULTIMATE.start_main_~v~0.offset_6, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~v~0.base=v_ULTIMATE.start_main_~v~0.base_7, #length=|v_#length_48|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~v~0.offset=v_ULTIMATE.start_main_~v~0.offset_6, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~v~0.base=v_ULTIMATE.start_main_~v~0.base_7, #length=|v_#length_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 61#L13true [160] L13-->L13-1: Formula: (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~z~0.base_4)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_4 4) (select |v_#length_17| v_ULTIMATE.start_main_~z~0.base_4)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~z~0.base_4) v_ULTIMATE.start_main_~z~0.offset_4))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, #memory_int=|v_#memory_int_7|, #length=|v_#length_17|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_4, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_4, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 60#L13-1true [410] L13-1-->L14: Formula: (and (<= (+ v_ULTIMATE.start_main_~w~0.offset_6 4) (select |v_#length_49| v_ULTIMATE.start_main_~w~0.base_7)) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~w~0.base_7)) (<= 0 v_ULTIMATE.start_main_~w~0.offset_6) (= (store |v_#memory_int_33| v_ULTIMATE.start_main_~w~0.base_7 (store (select |v_#memory_int_33| v_ULTIMATE.start_main_~w~0.base_7) v_ULTIMATE.start_main_~w~0.offset_6 |v_ULTIMATE.start_main_#t~mem9_6|)) |v_#memory_int_32|)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~w~0.base=v_ULTIMATE.start_main_~w~0.base_7, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_33|, #length=|v_#length_49|, ULTIMATE.start_main_~w~0.offset=v_ULTIMATE.start_main_~w~0.offset_6} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~w~0.base=v_ULTIMATE.start_main_~w~0.base_7, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_32|, #length=|v_#length_49|, ULTIMATE.start_main_~w~0.offset=v_ULTIMATE.start_main_~w~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 16#L14true [103] L14-->L18-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~c~0.offset_4 4) (select |v_#length_21| v_ULTIMATE.start_main_~c~0.base_4)) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~c~0.base_4 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~c~0.base_4) v_ULTIMATE.start_main_~c~0.offset_4 0)) |v_#memory_int_10|) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~c~0.base_4)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_4)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_11|, #length=|v_#length_21|, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_10|, #length=|v_#length_21|, #valid=|v_#valid_23|} AuxVars[] AssignedVars[#memory_int] 3#L18-3true [2020-07-01 12:44:27,921 INFO L796 eck$LassoCheckResult]: Loop: 3#L18-3true [90] L18-3-->L16: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_23| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_12|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 34#L16true [418] L16-->L17: Formula: (and (<= (select (select |v_#memory_int_42| v_ULTIMATE.start_main_~y~0.base_17) v_ULTIMATE.start_main_~y~0.offset_13) |v_ULTIMATE.start_main_#t~mem10_14|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_13 4) (select |v_#length_54| v_ULTIMATE.start_main_~y~0.base_17)) (= 1 (select |v_#valid_70| v_ULTIMATE.start_main_~y~0.base_17)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_13)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_42|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_17, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_13, #length=|v_#length_54|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_13|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_13|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_42|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_17, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_13, #length=|v_#length_54|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11] 54#L17true [153] L17-->L17-1: Formula: (and (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~c~0.base_7) v_ULTIMATE.start_main_~c~0.offset_6) |v_ULTIMATE.start_main_#t~mem12_2|) (<= 0 v_ULTIMATE.start_main_~c~0.offset_6) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~c~0.base_7)) (<= (+ v_ULTIMATE.start_main_~c~0.offset_6 4) (select |v_#length_27| v_ULTIMATE.start_main_~c~0.base_7))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_7, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_6, #memory_int=|v_#memory_int_14|, #length=|v_#length_27|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_7, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_6, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_14|, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 52#L17-1true [413] L17-1-->L18: Formula: (and (= 1 (select |v_#valid_64| v_ULTIMATE.start_main_~c~0.base_13)) (= |v_#memory_int_34| (store |v_#memory_int_35| v_ULTIMATE.start_main_~c~0.base_13 (store (select |v_#memory_int_35| v_ULTIMATE.start_main_~c~0.base_13) v_ULTIMATE.start_main_~c~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem12_6| 1)))) (<= 0 v_ULTIMATE.start_main_~c~0.offset_10) (<= (+ v_ULTIMATE.start_main_~c~0.offset_10 4) (select |v_#length_50| v_ULTIMATE.start_main_~c~0.base_13))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_13, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_10, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_35|, #length=|v_#length_50|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_13, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_10, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_34|, #length=|v_#length_50|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12, #memory_int] 8#L18true [95] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6)) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~z~0.base_7)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_31| v_ULTIMATE.start_main_~z~0.base_7))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_17|, #length=|v_#length_31|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_17|, #length=|v_#length_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 7#L18-1true [189] L18-1-->L22: Formula: (>= 1 |v_ULTIMATE.start_main_#t~mem13_6|) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 30#L22true [123] L22-->L22-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem17_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_43| v_ULTIMATE.start_main_~y~0.base_10)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_43|, #valid=|v_#valid_45|} OutVars{#valid=|v_#valid_45|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_43|, ULTIMATE.start_main_#t~mem17=|v_ULTIMATE.start_main_#t~mem17_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem17] 26#L22-1true [416] L22-1-->L18-3: Formula: (and (= (store |v_#memory_int_39| v_ULTIMATE.start_main_~y~0.base_16 (store (select |v_#memory_int_39| v_ULTIMATE.start_main_~y~0.base_16) v_ULTIMATE.start_main_~y~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem17_6| 1))) |v_#memory_int_38|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_12) (= 1 (select |v_#valid_68| v_ULTIMATE.start_main_~y~0.base_16)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_12 4) (select |v_#length_52| v_ULTIMATE.start_main_~y~0.base_16))) InVars {#valid=|v_#valid_68|, #memory_int=|v_#memory_int_39|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_16, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_12, #length=|v_#length_52|, ULTIMATE.start_main_#t~mem17=|v_ULTIMATE.start_main_#t~mem17_6|} OutVars{#valid=|v_#valid_68|, #memory_int=|v_#memory_int_38|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_16, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_12, #length=|v_#length_52|, ULTIMATE.start_main_#t~mem17=|v_ULTIMATE.start_main_#t~mem17_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem17] 3#L18-3true [2020-07-01 12:44:27,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:27,922 INFO L82 PathProgramCache]: Analyzing trace with hash -431913188, now seen corresponding path program 1 times [2020-07-01 12:44:27,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:27,923 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35289180] [2020-07-01 12:44:27,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:27,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35289180] [2020-07-01 12:44:27,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:27,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:27,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914194490] [2020-07-01 12:44:27,940 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:44:27,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:27,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1789240080, now seen corresponding path program 1 times [2020-07-01 12:44:27,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:27,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460479621] [2020-07-01 12:44:27,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:44:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:44:27,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:44:28,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:28,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:28,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,122 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2020-07-01 12:44:28,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:28,557 INFO L93 Difference]: Finished difference Result 60 states and 99 transitions. [2020-07-01 12:44:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:28,575 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:44:28,579 INFO L168 Benchmark]: Toolchain (without parser) took 5382.16 ms. Allocated memory was 514.9 MB in the beginning and 639.1 MB in the end (delta: 124.3 MB). Free memory was 438.0 MB in the beginning and 587.4 MB in the end (delta: -149.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:44:28,579 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 458.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:44:28,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.57 ms. Allocated memory was 514.9 MB in the beginning and 562.0 MB in the end (delta: 47.2 MB). Free memory was 437.5 MB in the beginning and 528.9 MB in the end (delta: -91.4 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:28,580 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.41 ms. Allocated memory is still 562.0 MB. Free memory was 528.9 MB in the beginning and 526.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:28,581 INFO L168 Benchmark]: Boogie Preprocessor took 25.76 ms. Allocated memory is still 562.0 MB. Free memory was 526.8 MB in the beginning and 525.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:28,581 INFO L168 Benchmark]: RCFGBuilder took 464.94 ms. Allocated memory is still 562.0 MB. Free memory was 525.1 MB in the beginning and 494.3 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:28,582 INFO L168 Benchmark]: BlockEncodingV2 took 227.40 ms. Allocated memory is still 562.0 MB. Free memory was 494.3 MB in the beginning and 459.8 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:28,582 INFO L168 Benchmark]: TraceAbstraction took 3586.68 ms. Allocated memory was 562.0 MB in the beginning and 638.6 MB in the end (delta: 76.5 MB). Free memory was 459.2 MB in the beginning and 489.9 MB in the end (delta: -30.6 MB). Peak memory consumption was 45.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:28,583 INFO L168 Benchmark]: BuchiAutomizer took 716.34 ms. Allocated memory was 638.6 MB in the beginning and 639.1 MB in the end (delta: 524.3 kB). Free memory was 486.4 MB in the beginning and 587.4 MB in the end (delta: -101.0 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:44:28,586 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 72 locations, 74 edges - StatisticsResult: Encoded RCFG 60 locations, 226 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 458.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 312.57 ms. Allocated memory was 514.9 MB in the beginning and 562.0 MB in the end (delta: 47.2 MB). Free memory was 437.5 MB in the beginning and 528.9 MB in the end (delta: -91.4 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.41 ms. Allocated memory is still 562.0 MB. Free memory was 528.9 MB in the beginning and 526.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.76 ms. Allocated memory is still 562.0 MB. Free memory was 526.8 MB in the beginning and 525.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 464.94 ms. Allocated memory is still 562.0 MB. Free memory was 525.1 MB in the beginning and 494.3 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 227.40 ms. Allocated memory is still 562.0 MB. Free memory was 494.3 MB in the beginning and 459.8 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 3586.68 ms. Allocated memory was 562.0 MB in the beginning and 638.6 MB in the end (delta: 76.5 MB). Free memory was 459.2 MB in the beginning and 489.9 MB in the end (delta: -30.6 MB). Peak memory consumption was 45.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 716.34 ms. Allocated memory was 638.6 MB in the beginning and 639.1 MB in the end (delta: 524.3 kB). Free memory was 486.4 MB in the beginning and 587.4 MB in the end (delta: -101.0 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 38 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 12:44:28,596 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:44:28,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,598 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,598 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,598 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,599 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:44:28,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,601 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,601 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((((4 == unknown-#length-unknown[z] && \valid[x] == 1) && \valid[w] == 1) && 1 == \valid[u]) && 1 == \valid[z]) && 4 == unknown-#length-unknown[c]) && unknown-#length-unknown[x] == 4) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == c) && 4 == unknown-#length-unknown[v]) && \valid[v] == 1) && 4 == unknown-#length-unknown[w]) && 4 == unknown-#length-unknown[y]) && 0 == z) && 0 == y) && 0 == v) && 1 == \valid[y]) && 1 == \valid[c]) && 0 == x) && 0 == w) && 4 == unknown-#length-unknown[u]) && 0 == u - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 38 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 122 SDtfs, 1230 SDslu, 11 SDs, 0 SdLazy, 1031 SolverSat, 187 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 95 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 2900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:44:19.912 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_6vEmVO/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:44:28.825 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check