./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b6ea490b9c20ea87d0996e916d918afb3a914616 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:56:48,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:48,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:48,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:48,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:48,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:48,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:48,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:48,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:48,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:48,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:48,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:48,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:48,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:48,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:48,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:48,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:48,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:48,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:48,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:48,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:48,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:48,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:48,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:48,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:48,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:48,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:48,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:48,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:48,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:48,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:48,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:48,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:48,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:48,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:48,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:48,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:48,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:48,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:48,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:48,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:48,386 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:56:48,399 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:48,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:48,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:48,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:48,404 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:48,404 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:56:48,404 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:56:48,404 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:56:48,404 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:56:48,404 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:56:48,405 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:56:48,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:48,405 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:56:48,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:48,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:48,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:56:48,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:56:48,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:56:48,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:48,406 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:56:48,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:48,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:56:48,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:48,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:48,407 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:56:48,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:48,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:48,408 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:56:48,408 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:56:48,410 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6ea490b9c20ea87d0996e916d918afb3a914616 [2019-10-22 08:56:48,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:48,459 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:48,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:48,464 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:48,464 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:48,465 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i [2019-10-22 08:56:48,513 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/data/718e92bb2/158737fd609c48a5bdf01de50ec30dbe/FLAG7859a5ff9 [2019-10-22 08:56:48,996 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:48,999 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i [2019-10-22 08:56:49,009 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/data/718e92bb2/158737fd609c48a5bdf01de50ec30dbe/FLAG7859a5ff9 [2019-10-22 08:56:49,486 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/data/718e92bb2/158737fd609c48a5bdf01de50ec30dbe [2019-10-22 08:56:49,489 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:49,490 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:49,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:49,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:49,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:49,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:49" (1/1) ... [2019-10-22 08:56:49,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39466626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:49, skipping insertion in model container [2019-10-22 08:56:49,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:49" (1/1) ... [2019-10-22 08:56:49,506 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:49,547 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:49,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:49,901 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:49,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:49,995 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:49,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:49 WrapperNode [2019-10-22 08:56:49,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:49,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:49,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:49,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:50,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:49" (1/1) ... [2019-10-22 08:56:50,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:49" (1/1) ... [2019-10-22 08:56:50,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:50,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:50,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:50,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:50,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:49" (1/1) ... [2019-10-22 08:56:50,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:49" (1/1) ... [2019-10-22 08:56:50,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:49" (1/1) ... [2019-10-22 08:56:50,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:49" (1/1) ... [2019-10-22 08:56:50,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:49" (1/1) ... [2019-10-22 08:56:50,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:49" (1/1) ... [2019-10-22 08:56:50,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:49" (1/1) ... [2019-10-22 08:56:50,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:50,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:50,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:50,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:50,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:56:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:56:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:50,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:50,280 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:50,280 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-22 08:56:50,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:50 BoogieIcfgContainer [2019-10-22 08:56:50,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:50,282 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:56:50,282 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:56:50,286 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:56:50,290 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:50,290 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:56:49" (1/3) ... [2019-10-22 08:56:50,291 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2298079f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:50, skipping insertion in model container [2019-10-22 08:56:50,291 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:50,291 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:49" (2/3) ... [2019-10-22 08:56:50,292 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2298079f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:50, skipping insertion in model container [2019-10-22 08:56:50,292 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:50,292 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:50" (3/3) ... [2019-10-22 08:56:50,294 INFO L371 chiAutomizerObserver]: Analyzing ICFG Urban-2013WST-Fig2-alloca.i [2019-10-22 08:56:50,384 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:56:50,393 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:56:50,393 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:56:50,393 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:50,393 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:50,393 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:56:50,393 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:50,393 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:56:50,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 08:56:50,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:50,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:50,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:50,438 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:50,438 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:56:50,438 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:56:50,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 08:56:50,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:50,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:50,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:50,439 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:50,439 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:56:50,447 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 8#L549-3true [2019-10-22 08:56:50,447 INFO L793 eck$LassoCheckResult]: Loop: 8#L549-3true call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 4#L549-1true assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 5#L551-3true assume !true; 7#L551-4true call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 8#L549-3true [2019-10-22 08:56:50,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:50,453 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:56:50,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:50,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199162482] [2019-10-22 08:56:50,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:50,579 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:50,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:50,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2019-10-22 08:56:50,580 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:50,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066401023] [2019-10-22 08:56:50,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:50,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066401023] [2019-10-22 08:56:50,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:50,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:56:50,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504102409] [2019-10-22 08:56:50,621 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:50,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:50,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:56:50,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:56:50,634 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 2 states. [2019-10-22 08:56:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:50,639 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-10-22 08:56:50,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:56:50,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-10-22 08:56:50,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:50,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2019-10-22 08:56:50,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:56:50,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:56:50,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-10-22 08:56:50,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:50,647 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-10-22 08:56:50,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-10-22 08:56:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-10-22 08:56:50,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:56:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-10-22 08:56:50,670 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-10-22 08:56:50,670 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-10-22 08:56:50,670 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:56:50,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-10-22 08:56:50,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:50,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:50,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:50,671 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:50,671 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:50,672 INFO L791 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 30#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 31#L549-3 [2019-10-22 08:56:50,672 INFO L793 eck$LassoCheckResult]: Loop: 31#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 32#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 33#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 34#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 36#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 31#L549-3 [2019-10-22 08:56:50,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:50,672 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 08:56:50,672 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:50,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631053690] [2019-10-22 08:56:50,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:50,692 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:50,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:50,692 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2019-10-22 08:56:50,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:50,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925221086] [2019-10-22 08:56:50,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:50,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925221086] [2019-10-22 08:56:50,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:50,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:50,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640589185] [2019-10-22 08:56:50,756 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:50,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:50,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:50,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:50,757 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-10-22 08:56:50,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:50,798 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-10-22 08:56:50,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:50,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-10-22 08:56:50,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:56:50,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2019-10-22 08:56:50,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:56:50,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:56:50,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2019-10-22 08:56:50,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:50,801 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-10-22 08:56:50,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2019-10-22 08:56:50,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-10-22 08:56:50,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:56:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-10-22 08:56:50,803 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-10-22 08:56:50,803 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-10-22 08:56:50,803 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:56:50,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-10-22 08:56:50,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:56:50,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:50,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:50,804 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:50,804 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-10-22 08:56:50,804 INFO L791 eck$LassoCheckResult]: Stem: 61#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 57#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 58#L549-3 [2019-10-22 08:56:50,805 INFO L793 eck$LassoCheckResult]: Loop: 58#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 59#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 55#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 56#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 62#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 63#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 60#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 58#L549-3 [2019-10-22 08:56:50,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:50,805 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-10-22 08:56:50,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:50,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719537826] [2019-10-22 08:56:50,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:50,832 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:50,836 INFO L82 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2019-10-22 08:56:50,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:50,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912407607] [2019-10-22 08:56:50,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:50,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912407607] [2019-10-22 08:56:50,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965837054] [2019-10-22 08:56:50,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:50,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:50,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:50,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 08:56:50,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:51,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-22 08:56:51,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:51,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:51,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:51,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 08:56:51,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:51,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-22 08:56:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:51,038 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:51,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-22 08:56:51,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940620736] [2019-10-22 08:56:51,039 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:51,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:51,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:56:51,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:56:51,039 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 7 states. [2019-10-22 08:56:51,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:51,085 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-10-22 08:56:51,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:51,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-10-22 08:56:51,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:56:51,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2019-10-22 08:56:51,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:56:51,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:56:51,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2019-10-22 08:56:51,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:51,087 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-10-22 08:56:51,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2019-10-22 08:56:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-10-22 08:56:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:56:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-10-22 08:56:51,089 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-10-22 08:56:51,089 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-10-22 08:56:51,089 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:56:51,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-10-22 08:56:51,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:56:51,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:51,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:51,090 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:51,090 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2019-10-22 08:56:51,090 INFO L791 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 107#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 108#L549-3 [2019-10-22 08:56:51,090 INFO L793 eck$LassoCheckResult]: Loop: 108#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 109#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 105#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 106#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 112#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 115#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 114#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 113#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 110#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 108#L549-3 [2019-10-22 08:56:51,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:51,091 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-10-22 08:56:51,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:51,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847459537] [2019-10-22 08:56:51,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:51,107 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:51,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:51,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1970998361, now seen corresponding path program 2 times [2019-10-22 08:56:51,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:51,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109889017] [2019-10-22 08:56:51,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:51,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109889017] [2019-10-22 08:56:51,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122062591] [2019-10-22 08:56:51,297 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:51,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:56:51,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:51,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:51,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:51,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 08:56:51,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:51,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-22 08:56:51,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:51,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:51,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:51,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:51,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:51,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:51,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 08:56:51,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:51,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-22 08:56:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:51,400 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:51,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2019-10-22 08:56:51,401 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588331114] [2019-10-22 08:56:51,401 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:51,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:51,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:56:51,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:56:51,402 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 10 states. [2019-10-22 08:56:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:51,493 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-10-22 08:56:51,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:56:51,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-10-22 08:56:51,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-10-22 08:56:51,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-10-22 08:56:51,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:56:51,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:56:51,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-10-22 08:56:51,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:51,495 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-22 08:56:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-10-22 08:56:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 08:56:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:56:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-22 08:56:51,500 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-22 08:56:51,500 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-22 08:56:51,500 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:56:51,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-10-22 08:56:51,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-10-22 08:56:51,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:51,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:51,501 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:51,502 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 1, 1, 1, 1] [2019-10-22 08:56:51,502 INFO L791 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 172#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 173#L549-3 [2019-10-22 08:56:51,502 INFO L793 eck$LassoCheckResult]: Loop: 173#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 174#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 175#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 178#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 170#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 171#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 182#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 181#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 180#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 179#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 176#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 173#L549-3 [2019-10-22 08:56:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-10-22 08:56:51,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:51,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886728891] [2019-10-22 08:56:51,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:51,521 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:51,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:51,522 INFO L82 PathProgramCache]: Analyzing trace with hash -48795806, now seen corresponding path program 3 times [2019-10-22 08:56:51,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:51,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630250434] [2019-10-22 08:56:51,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:51,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630250434] [2019-10-22 08:56:51,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446086754] [2019-10-22 08:56:51,659 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:51,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-22 08:56:51,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:51,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:56:51,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:51,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 08:56:51,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:51,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-22 08:56:51,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:51,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:51,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:51,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:51,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:51,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:51,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:51,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:51,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:51,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 08:56:51,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:51,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:51,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-22 08:56:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:51,798 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:51,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2019-10-22 08:56:51,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420410602] [2019-10-22 08:56:51,799 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:51,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:51,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 08:56:51,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:56:51,799 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 13 states. [2019-10-22 08:56:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:51,899 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-10-22 08:56:51,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:56:51,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2019-10-22 08:56:51,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-10-22 08:56:51,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2019-10-22 08:56:51,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 08:56:51,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 08:56:51,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2019-10-22 08:56:51,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:51,902 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-22 08:56:51,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2019-10-22 08:56:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-22 08:56:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:56:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-10-22 08:56:51,904 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-22 08:56:51,904 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-22 08:56:51,904 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:56:51,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-10-22 08:56:51,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-10-22 08:56:51,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:51,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:51,905 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:51,905 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2019-10-22 08:56:51,906 INFO L791 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 250#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 251#L549-3 [2019-10-22 08:56:51,906 INFO L793 eck$LassoCheckResult]: Loop: 251#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 252#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 253#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 258#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 254#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 255#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 264#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 263#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 262#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 261#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 260#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 259#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 257#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 251#L549-3 [2019-10-22 08:56:51,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:51,906 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2019-10-22 08:56:51,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:51,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168422916] [2019-10-22 08:56:51,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:51,919 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:51,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:51,920 INFO L82 PathProgramCache]: Analyzing trace with hash 351922269, now seen corresponding path program 4 times [2019-10-22 08:56:51,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:51,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325088988] [2019-10-22 08:56:51,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:52,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325088988] [2019-10-22 08:56:52,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475698048] [2019-10-22 08:56:52,098 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:52,142 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 08:56:52,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:52,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:56:52,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:52,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 08:56:52,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:52,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-22 08:56:52,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:52,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:52,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:52,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:52,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:52,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:52,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:52,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:52,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:52,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:52,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:52,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:52,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 08:56:52,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:52,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-22 08:56:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:52,269 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:52,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2019-10-22 08:56:52,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107514050] [2019-10-22 08:56:52,270 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:52,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:52,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 08:56:52,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-10-22 08:56:52,271 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand 16 states. [2019-10-22 08:56:52,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:52,454 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-10-22 08:56:52,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:56:52,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2019-10-22 08:56:52,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-10-22 08:56:52,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2019-10-22 08:56:52,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:56:52,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:56:52,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2019-10-22 08:56:52,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:52,456 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-22 08:56:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2019-10-22 08:56:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-22 08:56:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:56:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-10-22 08:56:52,458 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-22 08:56:52,458 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-22 08:56:52,458 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:56:52,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-10-22 08:56:52,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-10-22 08:56:52,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:52,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:52,460 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:52,460 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 1, 1, 1, 1] [2019-10-22 08:56:52,460 INFO L791 eck$LassoCheckResult]: Stem: 351#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 345#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 346#L549-3 [2019-10-22 08:56:52,460 INFO L793 eck$LassoCheckResult]: Loop: 346#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 347#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 348#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 353#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 349#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 350#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 361#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 360#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 359#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 358#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 357#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 356#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 355#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 354#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 352#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 346#L549-3 [2019-10-22 08:56:52,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:52,460 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2019-10-22 08:56:52,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:52,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350495184] [2019-10-22 08:56:52,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:52,480 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:52,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:52,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1105064296, now seen corresponding path program 5 times [2019-10-22 08:56:52,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:52,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53468799] [2019-10-22 08:56:52,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:52,695 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:52,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53468799] [2019-10-22 08:56:52,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507617709] [2019-10-22 08:56:52,695 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:52,757 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-22 08:56:52,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:52,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:56:52,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:52,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 08:56:52,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:52,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-22 08:56:52,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:52,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:52,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,783 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:52,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:52,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:52,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:52,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:52,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:52,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:52,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:52,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:52,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:52,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:52,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:52,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:52,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 08:56:52,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:52,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:52,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-22 08:56:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:52,881 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:52,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2019-10-22 08:56:52,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084130725] [2019-10-22 08:56:52,882 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:52,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:52,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-22 08:56:52,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-10-22 08:56:52,883 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand 19 states. [2019-10-22 08:56:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:53,065 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-10-22 08:56:53,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:56:53,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2019-10-22 08:56:53,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-10-22 08:56:53,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2019-10-22 08:56:53,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-10-22 08:56:53,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-10-22 08:56:53,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2019-10-22 08:56:53,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:53,066 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-10-22 08:56:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2019-10-22 08:56:53,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-22 08:56:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 08:56:53,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-10-22 08:56:53,068 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-10-22 08:56:53,068 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-10-22 08:56:53,068 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:56:53,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2019-10-22 08:56:53,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-10-22 08:56:53,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:53,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:53,068 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:53,068 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1] [2019-10-22 08:56:53,069 INFO L791 eck$LassoCheckResult]: Stem: 462#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 457#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 458#L549-3 [2019-10-22 08:56:53,069 INFO L793 eck$LassoCheckResult]: Loop: 458#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 459#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 460#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 463#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 455#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 456#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 473#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 472#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 471#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 470#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 469#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 468#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 467#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 466#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 465#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 464#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 461#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 458#L549-3 [2019-10-22 08:56:53,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:53,069 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2019-10-22 08:56:53,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:53,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188838372] [2019-10-22 08:56:53,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,078 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:53,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:53,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1109814765, now seen corresponding path program 6 times [2019-10-22 08:56:53,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:53,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942773608] [2019-10-22 08:56:53,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:53,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942773608] [2019-10-22 08:56:53,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235913371] [2019-10-22 08:56:53,227 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:53,274 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-22 08:56:53,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:53,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:56:53,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:53,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 08:56:53,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-22 08:56:53,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:53,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:53,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:53,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:53,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:53,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:53,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:53,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:53,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:53,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:53,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:53,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:53,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 08:56:53,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-22 08:56:53,403 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:53,403 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:53,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 22 [2019-10-22 08:56:53,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818076001] [2019-10-22 08:56:53,404 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:53,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:53,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-22 08:56:53,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-10-22 08:56:53,404 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand 22 states. [2019-10-22 08:56:53,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:53,596 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-10-22 08:56:53,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 08:56:53,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2019-10-22 08:56:53,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-10-22 08:56:53,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2019-10-22 08:56:53,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-10-22 08:56:53,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-10-22 08:56:53,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2019-10-22 08:56:53,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:53,599 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-22 08:56:53,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2019-10-22 08:56:53,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-22 08:56:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 08:56:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-10-22 08:56:53,601 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-22 08:56:53,601 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-22 08:56:53,601 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:56:53,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2019-10-22 08:56:53,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-10-22 08:56:53,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:53,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:53,602 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:53,602 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 1, 1, 1, 1] [2019-10-22 08:56:53,603 INFO L791 eck$LassoCheckResult]: Stem: 586#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 582#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 583#L549-3 [2019-10-22 08:56:53,603 INFO L793 eck$LassoCheckResult]: Loop: 583#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 584#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 585#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 588#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 580#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 581#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 600#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 599#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 598#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 597#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 596#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 595#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 594#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 593#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 592#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 591#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 590#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 589#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 587#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 583#L549-3 [2019-10-22 08:56:53,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:53,603 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2019-10-22 08:56:53,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:53,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841172404] [2019-10-22 08:56:53,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,612 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:53,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:53,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1380048178, now seen corresponding path program 7 times [2019-10-22 08:56:53,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:53,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426818007] [2019-10-22 08:56:53,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:53,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426818007] [2019-10-22 08:56:53,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73730053] [2019-10-22 08:56:53,798 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:53,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:56:53,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:53,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 08:56:53,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-22 08:56:53,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:53,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:53,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:53,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:53,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:53,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:53,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:53,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:53,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:53,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:53,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:53,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:53,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:53,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:53,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 08:56:53,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:53,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:53,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-22 08:56:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:53,986 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:53,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 25 [2019-10-22 08:56:53,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634691929] [2019-10-22 08:56:53,986 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:53,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:53,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-22 08:56:53,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2019-10-22 08:56:53,987 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 2 Second operand 25 states. [2019-10-22 08:56:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:54,234 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-10-22 08:56:54,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 08:56:54,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2019-10-22 08:56:54,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-10-22 08:56:54,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2019-10-22 08:56:54,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-10-22 08:56:54,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-10-22 08:56:54,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2019-10-22 08:56:54,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:54,238 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-22 08:56:54,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2019-10-22 08:56:54,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-22 08:56:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 08:56:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-10-22 08:56:54,240 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-22 08:56:54,240 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-22 08:56:54,240 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:56:54,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2019-10-22 08:56:54,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-10-22 08:56:54,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:54,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:54,241 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:54,242 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 1, 1, 1, 1] [2019-10-22 08:56:54,242 INFO L791 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 722#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 723#L549-3 [2019-10-22 08:56:54,242 INFO L793 eck$LassoCheckResult]: Loop: 723#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 724#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 725#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 728#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 720#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 721#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 742#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 741#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 740#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 739#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 738#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 737#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 736#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 735#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 734#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 733#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 732#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 731#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 730#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 729#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 727#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 723#L549-3 [2019-10-22 08:56:54,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:54,242 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2019-10-22 08:56:54,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:54,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451279945] [2019-10-22 08:56:54,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:54,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:54,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:54,252 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:54,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:54,260 INFO L82 PathProgramCache]: Analyzing trace with hash 918646985, now seen corresponding path program 8 times [2019-10-22 08:56:54,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:54,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443245925] [2019-10-22 08:56:54,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:54,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:54,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:54,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443245925] [2019-10-22 08:56:54,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911165954] [2019-10-22 08:56:54,462 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:54,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:56:54,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:54,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:56:54,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:54,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 08:56:54,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:54,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-22 08:56:54,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:54,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:54,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:54,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:54,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:54,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:54,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:54,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:54,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:54,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:54,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:54,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:54,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:54,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:54,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:54,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:54,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:54,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:54,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:54,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:54,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:54,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:54,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:54,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:54,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 08:56:54,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:54,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:54,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-22 08:56:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:54,681 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:54,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 28 [2019-10-22 08:56:54,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894796707] [2019-10-22 08:56:54,682 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:54,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:54,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-22 08:56:54,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2019-10-22 08:56:54,682 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 2 Second operand 28 states. [2019-10-22 08:56:55,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:55,017 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-10-22 08:56:55,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-22 08:56:55,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2019-10-22 08:56:55,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-10-22 08:56:55,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2019-10-22 08:56:55,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-10-22 08:56:55,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-10-22 08:56:55,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2019-10-22 08:56:55,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:55,019 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-22 08:56:55,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2019-10-22 08:56:55,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-22 08:56:55,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 08:56:55,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-10-22 08:56:55,020 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-22 08:56:55,020 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-22 08:56:55,020 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 08:56:55,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2019-10-22 08:56:55,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-10-22 08:56:55,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:55,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:55,021 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:55,022 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2019-10-22 08:56:55,022 INFO L791 eck$LassoCheckResult]: Stem: 881#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 875#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 876#L549-3 [2019-10-22 08:56:55,022 INFO L793 eck$LassoCheckResult]: Loop: 876#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 877#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 878#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 883#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 879#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 880#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 899#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 898#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 897#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 896#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 895#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 894#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 893#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 892#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 891#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 890#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 889#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 888#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 887#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 886#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 885#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 884#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 882#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 876#L549-3 [2019-10-22 08:56:55,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:55,022 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2019-10-22 08:56:55,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:55,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974737924] [2019-10-22 08:56:55,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:55,031 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:55,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:55,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1943458812, now seen corresponding path program 9 times [2019-10-22 08:56:55,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:55,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575362723] [2019-10-22 08:56:55,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:55,078 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:55,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1979445758, now seen corresponding path program 1 times [2019-10-22 08:56:55,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:55,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870440249] [2019-10-22 08:56:55,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:55,131 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:56,752 WARN L191 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 138 DAG size of output: 127 [2019-10-22 08:56:56,838 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:56,839 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:56,839 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:56,839 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:56,839 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:56,839 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:56,839 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:56,839 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:56,839 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca.i_Iteration11_Lasso [2019-10-22 08:56:56,839 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:56,840 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:56,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:56,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:57,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:57,362 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:57,367 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:57,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,370 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,370 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,370 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,370 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,371 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,371 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,374 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,374 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,374 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,374 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,374 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,374 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,375 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,376 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,376 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,378 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:57,378 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,380 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,381 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,381 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,381 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,381 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,381 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,382 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,383 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,383 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,383 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,383 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,383 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,383 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,384 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,385 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,385 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,385 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,385 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,386 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:57,386 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,388 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,388 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,388 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,388 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,389 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,389 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,389 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,390 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,390 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,390 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,390 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,391 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:57,392 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,394 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,396 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:57,396 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,398 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,398 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,400 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:57,400 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,407 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:57,407 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,412 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,412 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,413 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:57,413 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,415 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,415 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,415 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,415 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,418 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:57,418 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,434 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,435 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,435 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,435 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,435 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,435 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,435 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,438 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,438 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,438 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,438 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,438 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,438 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,438 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,440 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:57,442 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:56:57,443 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:56:57,444 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:57,445 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:56:57,445 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:57,445 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_1 + 21 Supporting invariants [] [2019-10-22 08:56:57,478 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 08:56:57,486 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:56:57,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:57,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:56:57,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:57,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:56:57,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:57,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2019-10-22 08:56:57,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:57,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-10-22 08:56:57,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-10-22 08:56:57,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:57,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-10-22 08:56:57,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-10-22 08:56:57,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:57,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-10-22 08:56:57,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-10-22 08:56:57,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:57,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-10-22 08:56:57,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-10-22 08:56:57,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:57,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-10-22 08:56:57,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-10-22 08:56:57,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:57,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-10-22 08:56:57,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-10-22 08:56:57,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:57,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-10-22 08:56:57,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-10-22 08:56:57,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:57,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-10-22 08:56:57,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-10-22 08:56:57,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:57,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2019-10-22 08:56:57,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-10-22 08:56:57,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:57,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:57,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:56:57,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:30 [2019-10-22 08:56:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:57,927 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 12 loop predicates [2019-10-22 08:56:57,928 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand 13 states. [2019-10-22 08:56:58,193 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2. Second operand 13 states. Result 57 states and 62 transitions. Complement of second has 26 states. [2019-10-22 08:56:58,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:56:58,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2019-10-22 08:56:58,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 2 letters. Loop has 23 letters. [2019-10-22 08:56:58,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:58,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 25 letters. Loop has 23 letters. [2019-10-22 08:56:58,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:58,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 2 letters. Loop has 46 letters. [2019-10-22 08:56:58,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:58,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 62 transitions. [2019-10-22 08:56:58,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-10-22 08:56:58,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 61 transitions. [2019-10-22 08:56:58,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-10-22 08:56:58,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-10-22 08:56:58,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 61 transitions. [2019-10-22 08:56:58,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:58,199 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-10-22 08:56:58,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 61 transitions. [2019-10-22 08:56:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-10-22 08:56:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-22 08:56:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2019-10-22 08:56:58,202 INFO L711 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2019-10-22 08:56:58,202 INFO L591 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2019-10-22 08:56:58,202 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 08:56:58,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 60 transitions. [2019-10-22 08:56:58,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-10-22 08:56:58,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:58,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:58,203 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:56:58,204 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 1, 1, 1, 1] [2019-10-22 08:56:58,204 INFO L791 eck$LassoCheckResult]: Stem: 1153#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1144#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1145#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1146#L549-1 [2019-10-22 08:56:58,204 INFO L793 eck$LassoCheckResult]: Loop: 1146#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 1147#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1150#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1159#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1179#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1178#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1177#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1176#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1175#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1174#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1173#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1172#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1171#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1170#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1169#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1168#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1167#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1166#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1165#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1164#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1163#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1162#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1161#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 1154#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 1155#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1146#L549-1 [2019-10-22 08:56:58,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:58,204 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-10-22 08:56:58,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:58,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229621976] [2019-10-22 08:56:58,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:58,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:58,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:58,213 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:58,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:58,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1726515181, now seen corresponding path program 10 times [2019-10-22 08:56:58,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:58,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896269268] [2019-10-22 08:56:58,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:58,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:58,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 84 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:58,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896269268] [2019-10-22 08:56:58,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384112798] [2019-10-22 08:56:58,480 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8eacf628-01b5-49d9-b8a8-f73fde76f270/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:58,532 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 08:56:58,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:58,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:56:58,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:58,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 08:56:58,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:58,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-22 08:56:58,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:58,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:58,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:58,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:58,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:58,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:58,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:58,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:58,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:58,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:58,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:58,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:58,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:58,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:58,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:58,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:58,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:58,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:58,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:58,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:58,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:58,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:58,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:58,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:58,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 08:56:58,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:58,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 08:56:58,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 08:56:58,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:58,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:58,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-22 08:56:58,807 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:58,807 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:58,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 30 [2019-10-22 08:56:58,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712218821] [2019-10-22 08:56:58,808 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:58,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:58,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-22 08:56:58,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2019-10-22 08:56:58,809 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. cyclomatic complexity: 7 Second operand 31 states. [2019-10-22 08:56:59,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:59,146 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-10-22 08:56:59,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-22 08:56:59,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 50 transitions. [2019-10-22 08:56:59,147 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:59,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2019-10-22 08:56:59,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:56:59,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:56:59,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:56:59,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:59,148 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:59,148 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:59,148 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:59,148 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 08:56:59,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:56:59,148 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:59,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:56:59,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:56:59 BoogieIcfgContainer [2019-10-22 08:56:59,158 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:56:59,158 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:59,158 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:59,159 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:59,159 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:50" (3/4) ... [2019-10-22 08:56:59,162 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:56:59,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:59,165 INFO L168 Benchmark]: Toolchain (without parser) took 9674.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 944.5 MB in the beginning and 1.3 GB in the end (delta: -331.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:59,165 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:59,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -191.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:59,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:59,166 INFO L168 Benchmark]: Boogie Preprocessor took 23.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:59,166 INFO L168 Benchmark]: RCFGBuilder took 222.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:59,166 INFO L168 Benchmark]: BuchiAutomizer took 8875.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -166.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:59,166 INFO L168 Benchmark]: Witness Printer took 5.40 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:59,167 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 504.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -191.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 222.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8875.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -166.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.40 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (11 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 21 and consists of 14 locations. 11 modules have a trivial ranking function, the largest among these consists of 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.7s and 13 iterations. TraceHistogramMax:11. Analysis of lassos took 6.1s. Construction of modules took 1.0s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 55 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/90 HoareTripleCheckerStatistics: 73 SDtfs, 93 SDslu, 180 SDs, 0 SdLazy, 1647 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital158 mio100 ax111 hnf100 lsp86 ukn73 mio100 lsp42 div100 bol100 ite100 ukn100 eq191 hnf88 smp100 dnf150 smp95 tf100 neg93 sie125 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...