./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cb3a55eb-2626-445c-a89c-3d23b3a26e39/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cb3a55eb-2626-445c-a89c-3d23b3a26e39/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cb3a55eb-2626-445c-a89c-3d23b3a26e39/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cb3a55eb-2626-445c-a89c-3d23b3a26e39/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cb3a55eb-2626-445c-a89c-3d23b3a26e39/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cb3a55eb-2626-445c-a89c-3d23b3a26e39/bin-2019/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 7464e7c5283b85fe14cc907bcd5d5339a700ef74 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:09:31,460 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:09:31,461 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:09:31,470 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:09:31,470 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:09:31,471 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:09:31,472 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:09:31,473 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:09:31,474 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:09:31,475 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:09:31,475 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:09:31,475 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:09:31,476 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:09:31,477 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:09:31,478 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:09:31,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:09:31,479 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:09:31,480 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:09:31,482 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:09:31,483 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:09:31,483 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:09:31,484 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:09:31,486 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:09:31,486 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:09:31,486 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:09:31,487 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:09:31,488 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:09:31,489 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:09:31,489 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:09:31,490 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:09:31,490 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:09:31,491 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:09:31,491 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:09:31,491 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:09:31,492 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:09:31,492 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:09:31,492 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cb3a55eb-2626-445c-a89c-3d23b3a26e39/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 13:09:31,504 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:09:31,504 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:09:31,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:09:31,505 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:09:31,505 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:09:31,505 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:09:31,505 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:09:31,506 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:09:31,506 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:09:31,506 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:09:31,506 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:09:31,506 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:09:31,506 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:09:31,506 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:09:31,507 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:09:31,507 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:09:31,507 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:09:31,507 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:09:31,507 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:09:31,507 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:09:31,507 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:09:31,508 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:09:31,508 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:09:31,508 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:09:31,508 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:09:31,508 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:09:31,508 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:09:31,508 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:09:31,509 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:09:31,509 INFO L133 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_cb3a55eb-2626-445c-a89c-3d23b3a26e39/bin-2019/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 -> 7464e7c5283b85fe14cc907bcd5d5339a700ef74 [2018-11-28 13:09:31,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:09:31,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:09:31,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:09:31,547 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:09:31,548 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:09:31,548 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cb3a55eb-2626-445c-a89c-3d23b3a26e39/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca_true-termination_true-no-overflow.c.i [2018-11-28 13:09:31,586 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cb3a55eb-2626-445c-a89c-3d23b3a26e39/bin-2019/uautomizer/data/a93adcf25/db413c70efb248508ea0c2340ff0942e/FLAGf8f38b46b [2018-11-28 13:09:32,023 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:09:32,023 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cb3a55eb-2626-445c-a89c-3d23b3a26e39/sv-benchmarks/c/termination-memory-alloca/b.15-alloca_true-termination_true-no-overflow.c.i [2018-11-28 13:09:32,030 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cb3a55eb-2626-445c-a89c-3d23b3a26e39/bin-2019/uautomizer/data/a93adcf25/db413c70efb248508ea0c2340ff0942e/FLAGf8f38b46b [2018-11-28 13:09:32,038 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cb3a55eb-2626-445c-a89c-3d23b3a26e39/bin-2019/uautomizer/data/a93adcf25/db413c70efb248508ea0c2340ff0942e [2018-11-28 13:09:32,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:09:32,041 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:09:32,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:09:32,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:09:32,045 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:09:32,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:09:32" (1/1) ... [2018-11-28 13:09:32,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581b6240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:32, skipping insertion in model container [2018-11-28 13:09:32,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:09:32" (1/1) ... [2018-11-28 13:09:32,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:09:32,081 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:09:32,268 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:09:32,278 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:09:32,356 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:09:32,384 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:09:32,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:32 WrapperNode [2018-11-28 13:09:32,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:09:32,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:09:32,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:09:32,385 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:09:32,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:32" (1/1) ... [2018-11-28 13:09:32,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:32" (1/1) ... [2018-11-28 13:09:32,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:09:32,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:09:32,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:09:32,413 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:09:32,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:32" (1/1) ... [2018-11-28 13:09:32,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:32" (1/1) ... [2018-11-28 13:09:32,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:32" (1/1) ... [2018-11-28 13:09:32,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:32" (1/1) ... [2018-11-28 13:09:32,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:32" (1/1) ... [2018-11-28 13:09:32,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:32" (1/1) ... [2018-11-28 13:09:32,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:32" (1/1) ... [2018-11-28 13:09:32,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:09:32,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:09:32,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:09:32,433 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:09:32,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb3a55eb-2626-445c-a89c-3d23b3a26e39/bin-2019/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 [2018-11-28 13:09:32,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:09:32,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:09:32,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:09:32,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:09:32,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:09:32,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:09:32,639 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:09:32,639 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 13:09:32,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:09:32 BoogieIcfgContainer [2018-11-28 13:09:32,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:09:32,640 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:09:32,640 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:09:32,643 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:09:32,644 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:09:32,644 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:09:32" (1/3) ... [2018-11-28 13:09:32,645 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24201aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:09:32, skipping insertion in model container [2018-11-28 13:09:32,645 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:09:32,645 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:32" (2/3) ... [2018-11-28 13:09:32,645 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24201aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:09:32, skipping insertion in model container [2018-11-28 13:09:32,645 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:09:32,645 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:09:32" (3/3) ... [2018-11-28 13:09:32,647 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.15-alloca_true-termination_true-no-overflow.c.i [2018-11-28 13:09:32,684 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:09:32,685 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:09:32,685 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:09:32,685 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:09:32,685 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:09:32,685 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:09:32,685 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:09:32,686 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:09:32,686 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:09:32,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 13:09:32,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:09:32,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:32,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:32,718 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:09:32,718 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:09:32,718 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:09:32,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 13:09:32,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:09:32,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:32,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:32,720 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:09:32,720 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:09:32,727 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 13#L558-4true [2018-11-28 13:09:32,728 INFO L796 eck$LassoCheckResult]: Loop: 13#L558-4true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 8#L557-1true assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 14#L557-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem8; 11#L558-3true assume !true; 13#L558-4true [2018-11-28 13:09:32,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:32,733 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 13:09:32,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:32,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:32,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:32,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:32,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:32,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:32,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1142256, now seen corresponding path program 1 times [2018-11-28 13:09:32,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:32,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:32,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:32,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:32,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:32,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:32,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-28 13:09:32,885 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:09:32,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 13:09:32,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 13:09:32,896 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-11-28 13:09:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:32,901 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-11-28 13:09:32,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 13:09:32,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-11-28 13:09:32,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:09:32,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 9 transitions. [2018-11-28 13:09:32,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 13:09:32,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 13:09:32,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2018-11-28 13:09:32,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:09:32,908 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-28 13:09:32,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2018-11-28 13:09:32,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-28 13:09:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 13:09:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-28 13:09:32,926 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-28 13:09:32,927 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-28 13:09:32,927 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:09:32,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2018-11-28 13:09:32,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:09:32,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:32,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:32,928 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:09:32,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:09:32,928 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L558-4 [2018-11-28 13:09:32,928 INFO L796 eck$LassoCheckResult]: Loop: 33#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 37#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 38#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem8; 36#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 35#L558-1 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 33#L558-4 [2018-11-28 13:09:32,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:32,929 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 13:09:32,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:32,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:32,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:32,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:32,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:32,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:32,966 INFO L82 PathProgramCache]: Analyzing trace with hash 35409745, now seen corresponding path program 1 times [2018-11-28 13:09:32,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:32,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:32,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:32,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:32,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:33,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:33,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:09:33,037 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:09:33,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:09:33,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:09:33,038 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-28 13:09:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:33,165 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-11-28 13:09:33,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:09:33,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2018-11-28 13:09:33,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 13:09:33,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 12 transitions. [2018-11-28 13:09:33,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 13:09:33,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 13:09:33,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2018-11-28 13:09:33,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:09:33,167 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 13:09:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2018-11-28 13:09:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-11-28 13:09:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 13:09:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-11-28 13:09:33,168 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-28 13:09:33,169 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-28 13:09:33,169 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:09:33,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-11-28 13:09:33,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 13:09:33,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:33,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:33,170 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:09:33,170 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-28 13:09:33,170 INFO L794 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 64#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 65#L558-4 [2018-11-28 13:09:33,170 INFO L796 eck$LassoCheckResult]: Loop: 65#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 69#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 70#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem8; 72#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 67#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 68#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 71#L558-1 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 65#L558-4 [2018-11-28 13:09:33,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:33,170 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-28 13:09:33,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:33,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:33,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:33,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:33,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:33,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:33,195 INFO L82 PathProgramCache]: Analyzing trace with hash -330970762, now seen corresponding path program 1 times [2018-11-28 13:09:33,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:33,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:33,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:33,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:33,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:33,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:33,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1215326068, now seen corresponding path program 1 times [2018-11-28 13:09:33,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:33,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:33,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:33,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:33,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:33,425 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2018-11-28 13:09:33,785 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-11-28 13:09:33,907 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-28 13:09:33,915 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:09:33,916 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:09:33,916 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:09:33,916 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:09:33,916 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:09:33,916 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:09:33,916 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:09:33,916 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:09:33,916 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.15-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-28 13:09:33,917 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:09:33,917 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:09:33,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:33,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:33,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:33,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:33,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:33,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:33,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:33,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:33,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:33,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:33,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:34,318 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2018-11-28 13:09:34,441 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2018-11-28 13:09:34,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:34,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:34,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:34,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:34,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:34,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:34,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:34,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:34,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:34,810 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:09:34,814 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:09:34,816 INFO L122 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 [2018-11-28 13:09:34,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:34,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:34,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:34,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:34,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:34,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:34,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:34,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:34,823 INFO L122 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 [2018-11-28 13:09:34,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:34,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:34,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:34,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:34,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:34,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:34,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:34,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:34,825 INFO L122 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 [2018-11-28 13:09:34,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:34,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:34,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:34,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:34,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:34,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:34,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:34,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:34,827 INFO L122 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 [2018-11-28 13:09:34,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:34,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:34,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:34,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:34,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:34,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:34,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:34,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:34,829 INFO L122 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 [2018-11-28 13:09:34,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:34,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:34,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:34,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:34,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:34,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:34,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:34,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:34,832 INFO L122 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 [2018-11-28 13:09:34,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:34,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:34,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:34,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:34,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:34,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:34,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:34,837 INFO L122 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 [2018-11-28 13:09:34,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:34,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:34,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:34,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:34,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:34,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:34,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:34,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:34,842 INFO L122 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 [2018-11-28 13:09:34,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:34,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:34,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:34,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:34,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:34,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:34,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:34,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:34,847 INFO L122 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 [2018-11-28 13:09:34,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:34,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:34,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:34,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:34,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:34,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:34,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:34,855 INFO L122 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 [2018-11-28 13:09:34,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:34,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:34,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:34,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:34,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:34,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:34,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:34,859 INFO L122 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 [2018-11-28 13:09:34,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:34,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:34,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:34,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:34,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:34,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:34,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:34,866 INFO L122 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 [2018-11-28 13:09:34,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:34,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:34,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:34,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:34,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:34,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:34,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:34,873 INFO L122 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 [2018-11-28 13:09:34,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:34,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:34,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:34,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:34,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:34,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:34,899 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:09:34,926 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 13:09:34,926 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 13:09:34,928 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:09:34,929 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:09:34,930 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:09:34,930 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 Supporting invariants [] [2018-11-28 13:09:35,045 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-28 13:09:35,051 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 13:09:35,051 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 13:09:35,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:35,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:35,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:35,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 90 [2018-11-28 13:09:35,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 83 treesize of output 72 [2018-11-28 13:09:35,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:35,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 83 [2018-11-28 13:09:35,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:35,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 93 [2018-11-28 13:09:35,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 96 treesize of output 87 [2018-11-28 13:09:35,369 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:35,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 119 [2018-11-28 13:09:35,439 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-11-28 13:09:35,493 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 13:09:35,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-11-28 13:09:35,572 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 25 [2018-11-28 13:09:35,573 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:35,581 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:35,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 79 [2018-11-28 13:09:35,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 72 treesize of output 63 [2018-11-28 13:09:35,659 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:35,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 70 [2018-11-28 13:09:35,686 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:35,705 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:09:35,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 13:09:35,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 89 treesize of output 103 [2018-11-28 13:09:35,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,803 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:35,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 102 [2018-11-28 13:09:35,806 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:36,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:36,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 75 [2018-11-28 13:09:36,370 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:36,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:36,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-11-28 13:09:36,960 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:37,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:37,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:37,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:37,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 87 [2018-11-28 13:09:37,556 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:38,116 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:38,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 75 [2018-11-28 13:09:38,119 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:38,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-28 13:09:38,120 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:38,128 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:38,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:38,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:38,834 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:38,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:38,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 112 [2018-11-28 13:09:38,836 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:39,108 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,121 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,139 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 110 [2018-11-28 13:09:39,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,164 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:09:39,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,172 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 137 [2018-11-28 13:09:39,173 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:39,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,223 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 133 [2018-11-28 13:09:39,225 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:39,251 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:09:39,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,435 INFO L478 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 3 case distinctions, treesize of input 68 treesize of output 79 [2018-11-28 13:09:39,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 77 [2018-11-28 13:09:39,444 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:39,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-11-28 13:09:39,484 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:39,506 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:09:39,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 83 [2018-11-28 13:09:39,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 67 [2018-11-28 13:09:39,667 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:39,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 74 [2018-11-28 13:09:39,705 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:39,728 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:09:39,969 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-11-28 13:09:39,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:39,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-11-28 13:09:39,981 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:39,989 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:40,052 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-28 13:09:40,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:40,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 88 [2018-11-28 13:09:40,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:40,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2018-11-28 13:09:40,071 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:40,116 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:40,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:40,118 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:40,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 68 [2018-11-28 13:09:40,119 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:40,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:40,162 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2018-11-28 13:09:40,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:40,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2018-11-28 13:09:40,167 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:40,178 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:40,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:40,211 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:40,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:40,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:40,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 98 [2018-11-28 13:09:40,214 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:40,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:40,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-11-28 13:09:40,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:40,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 treesize of output 34 [2018-11-28 13:09:40,251 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:40,256 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:40,273 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:09:40,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-28 13:09:40,343 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 1 variables, input treesize:99, output treesize:336 [2018-11-28 13:09:40,572 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-11-28 13:09:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:40,576 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 13:09:40,576 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-11-28 13:09:40,623 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3. Second operand 8 states. Result 20 states and 27 transitions. Complement of second has 10 states. [2018-11-28 13:09:40,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 13:09:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 13:09:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-28 13:09:40,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-28 13:09:40,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:40,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-28 13:09:40,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:40,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-28 13:09:40,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:40,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2018-11-28 13:09:40,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:40,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 17 transitions. [2018-11-28 13:09:40,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-28 13:09:40,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 13:09:40,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-28 13:09:40,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:40,629 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 13:09:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-28 13:09:40,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-28 13:09:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 13:09:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-28 13:09:40,631 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 13:09:40,631 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 13:09:40,631 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:09:40,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-28 13:09:40,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:40,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:40,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:40,632 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:40,632 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:40,633 INFO L794 eck$LassoCheckResult]: Stem: 303#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 301#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 302#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 308#L557-1 assume !test_fun_#t~short10; 309#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem8; 310#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 306#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 307#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 304#L558-1 [2018-11-28 13:09:40,633 INFO L796 eck$LassoCheckResult]: Loop: 304#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 305#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 304#L558-1 [2018-11-28 13:09:40,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:40,633 INFO L82 PathProgramCache]: Analyzing trace with hash 179598440, now seen corresponding path program 1 times [2018-11-28 13:09:40,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:40,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:40,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:40,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:09:40,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:40,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:09:40,657 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:40,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:40,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 1 times [2018-11-28 13:09:40,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:40,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:40,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:40,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:40,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:40,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:09:40,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:09:40,729 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 13:09:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:40,736 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-28 13:09:40,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:09:40,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2018-11-28 13:09:40,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:40,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 15 transitions. [2018-11-28 13:09:40,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-28 13:09:40,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-28 13:09:40,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2018-11-28 13:09:40,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:40,738 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 13:09:40,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2018-11-28 13:09:40,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-28 13:09:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 13:09:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-28 13:09:40,739 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 13:09:40,739 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 13:09:40,739 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 13:09:40,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-28 13:09:40,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:40,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:40,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:40,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:40,740 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:40,740 INFO L794 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 334#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 335#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 341#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 342#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem8; 343#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 339#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 340#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 337#L558-1 [2018-11-28 13:09:40,740 INFO L796 eck$LassoCheckResult]: Loop: 337#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 338#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 337#L558-1 [2018-11-28 13:09:40,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:40,741 INFO L82 PathProgramCache]: Analyzing trace with hash 177751398, now seen corresponding path program 1 times [2018-11-28 13:09:40,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:40,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:40,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:40,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:40,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:40,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:40,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 2 times [2018-11-28 13:09:40,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:40,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:40,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:40,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:40,780 INFO L82 PathProgramCache]: Analyzing trace with hash -979597471, now seen corresponding path program 2 times [2018-11-28 13:09:40,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:40,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:40,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:40,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:40,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:41,533 WARN L180 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 143 [2018-11-28 13:09:41,740 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-11-28 13:09:41,743 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:09:41,743 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:09:41,743 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:09:41,743 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:09:41,743 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:09:41,743 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:09:41,743 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:09:41,743 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:09:41,743 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.15-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-28 13:09:41,743 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:09:41,743 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:09:41,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:41,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:41,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:41,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:42,109 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 103 [2018-11-28 13:09:42,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:42,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:42,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:42,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:42,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:42,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:42,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:42,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:42,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:42,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:42,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:42,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:42,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:09:42,529 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:09:42,529 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:09:42,530 INFO L122 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 [2018-11-28 13:09:42,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:42,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:42,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:42,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:42,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:42,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:42,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:42,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:42,532 INFO L122 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 [2018-11-28 13:09:42,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:42,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:42,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:42,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:42,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:42,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:42,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:42,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:42,533 INFO L122 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 [2018-11-28 13:09:42,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:42,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:42,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:42,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:42,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:42,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:42,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:42,536 INFO L122 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 [2018-11-28 13:09:42,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:42,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:42,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:42,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:42,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:42,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:42,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:42,539 INFO L122 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 [2018-11-28 13:09:42,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:42,540 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:09:42,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:42,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:42,541 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:09:42,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:42,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:42,544 INFO L122 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 [2018-11-28 13:09:42,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:42,544 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:09:42,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:42,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:42,545 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:09:42,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:42,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:42,549 INFO L122 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 [2018-11-28 13:09:42,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:42,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:42,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:42,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:42,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:42,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:42,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:42,553 INFO L122 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 [2018-11-28 13:09:42,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:42,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:42,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:42,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:42,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:42,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:42,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:42,558 INFO L122 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 [2018-11-28 13:09:42,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:42,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:42,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:42,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:42,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:42,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:42,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:42,571 INFO L122 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 [2018-11-28 13:09:42,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:42,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:42,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:42,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:42,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:42,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:42,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:42,573 INFO L122 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 [2018-11-28 13:09:42,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:42,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:42,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:42,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:42,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:42,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:42,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:42,577 INFO L122 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 [2018-11-28 13:09:42,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:42,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:42,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:42,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:42,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:42,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:42,602 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:09:42,619 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:09:42,619 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:09:42,620 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:09:42,621 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-11-28 13:09:42,622 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:09:42,622 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem12, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = -1*ULTIMATE.start_test_fun_#t~mem12 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [-1*ULTIMATE.start_test_fun_#t~mem11 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 >= 0, -1*ULTIMATE.start_test_fun_#t~mem12 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 >= 0] [2018-11-28 13:09:42,761 INFO L297 tatePredicateManager]: 39 out of 43 supporting invariants were superfluous and have been removed [2018-11-28 13:09:42,766 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 13:09:42,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:42,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:42,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:42,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:42,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2018-11-28 13:09:42,870 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 22 [2018-11-28 13:09:42,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:42,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:42,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:09:42,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:23 [2018-11-28 13:09:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:42,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:43,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2018-11-28 13:09:43,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 16 [2018-11-28 13:09:43,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:43,053 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2018-11-28 13:09:43,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 29 [2018-11-28 13:09:43,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:43,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 25 treesize of output 43 [2018-11-28 13:09:43,103 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-28 13:09:43,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:43,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:43,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2018-11-28 13:09:43,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-11-28 13:09:43,123 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:43,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-28 13:09:43,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 27 [2018-11-28 13:09:43,138 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:43,141 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:43,145 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:43,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 84 [2018-11-28 13:09:43,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2018-11-28 13:09:43,176 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:43,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-11-28 13:09:43,331 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:43,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2018-11-28 13:09:43,468 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:43,594 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:09:43,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 52 [2018-11-28 13:09:43,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 51 [2018-11-28 13:09:43,613 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-11-28 13:09:43,629 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:09:43,712 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 92 [2018-11-28 13:09:43,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,730 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:09:43,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,737 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 111 [2018-11-28 13:09:43,737 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:43,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,781 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 101 [2018-11-28 13:09:43,796 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 4 xjuncts. [2018-11-28 13:09:43,850 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-28 13:09:43,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 45 [2018-11-28 13:09:43,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-28 13:09:43,932 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:43,936 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:43,969 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2018-11-28 13:09:43,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:43,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-11-28 13:09:43,980 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:43,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:44,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 47 [2018-11-28 13:09:44,005 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 3 xjuncts. [2018-11-28 13:09:44,014 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:44,028 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:44,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 13:09:44,043 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 2 variables, input treesize:83, output treesize:86 [2018-11-28 13:09:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:44,065 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-28 13:09:44,065 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-28 13:09:44,119 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 26 states and 31 transitions. Complement of second has 6 states. [2018-11-28 13:09:44,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:09:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 13:09:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-11-28 13:09:44,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 13:09:44,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:44,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 13:09:44,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:44,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 13:09:44,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:44,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-11-28 13:09:44,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:44,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2018-11-28 13:09:44,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-28 13:09:44,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-28 13:09:44,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-28 13:09:44,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:44,122 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 13:09:44,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-28 13:09:44,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-28 13:09:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 13:09:44,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-28 13:09:44,123 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 13:09:44,123 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 13:09:44,123 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 13:09:44,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-28 13:09:44,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:09:44,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:44,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:44,123 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2018-11-28 13:09:44,123 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:09:44,123 INFO L794 eck$LassoCheckResult]: Stem: 609#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 607#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 608#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 614#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 615#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem8; 617#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 612#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 613#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 616#L558-1 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 618#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 619#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 623#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem8; 622#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 621#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 620#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 610#L558-1 [2018-11-28 13:09:44,124 INFO L796 eck$LassoCheckResult]: Loop: 610#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 611#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 610#L558-1 [2018-11-28 13:09:44,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:44,124 INFO L82 PathProgramCache]: Analyzing trace with hash -618569641, now seen corresponding path program 2 times [2018-11-28 13:09:44,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:44,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:44,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:44,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:44,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:09:44,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:44,166 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb3a55eb-2626-445c-a89c-3d23b3a26e39/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:09:44,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:09:44,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:09:44,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:44,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:44,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-28 13:09:44,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 18 [2018-11-28 13:09:44,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:44,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-11-28 13:09:44,256 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 13:09:44,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:44,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:44,264 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-28 13:09:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:09:44,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:44,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 13:09:44,281 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:44,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:44,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 3 times [2018-11-28 13:09:44,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:44,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:44,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:44,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:44,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:44,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:09:44,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:09:44,338 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-28 13:09:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:44,375 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-28 13:09:44,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:09:44,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 14 transitions. [2018-11-28 13:09:44,375 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:09:44,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2018-11-28 13:09:44,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:09:44,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:09:44,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:09:44,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:09:44,376 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:09:44,376 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:09:44,376 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:09:44,376 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 13:09:44,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:09:44,376 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:09:44,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 13:09:44,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:09:44 BoogieIcfgContainer [2018-11-28 13:09:44,380 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:09:44,381 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:09:44,381 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:09:44,381 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:09:44,381 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:09:32" (3/4) ... [2018-11-28 13:09:44,383 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:09:44,383 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:09:44,384 INFO L168 Benchmark]: Toolchain (without parser) took 12343.04 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 361.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -118.4 MB). Peak memory consumption was 243.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:44,384 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:09:44,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:44,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.34 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. [2018-11-28 13:09:44,385 INFO L168 Benchmark]: Boogie Preprocessor took 19.55 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. [2018-11-28 13:09:44,385 INFO L168 Benchmark]: RCFGBuilder took 206.16 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:44,385 INFO L168 Benchmark]: BuchiAutomizer took 11740.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.2 MB). Peak memory consumption was 250.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:44,385 INFO L168 Benchmark]: Witness Printer took 2.72 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:09:44,386 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.34 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. * Boogie Preprocessor took 19.55 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 206.16 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11740.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.2 MB). Peak memory consumption was 250.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.72 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 6 locations. One deterministic module has affine ranking function -1 * aux-z_ref-aux + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.7s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 4.4s. Construction of modules took 0.1s. Büchi inclusion checks took 6.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 41 SDtfs, 26 SDslu, 28 SDs, 0 SdLazy, 82 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1189 mio100 ax102 hnf100 lsp96 ukn31 mio100 lsp33 div100 bol100 ite100 ukn100 eq191 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...