./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6803d588-fb2f-48a6-83e9-671168fc30e1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6803d588-fb2f-48a6-83e9-671168fc30e1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6803d588-fb2f-48a6-83e9-671168fc30e1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6803d588-fb2f-48a6-83e9-671168fc30e1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6803d588-fb2f-48a6-83e9-671168fc30e1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6803d588-fb2f-48a6-83e9-671168fc30e1/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 27b51ff95b1c87aada11269295eff3fc5c30957f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:44:47,707 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:44:47,709 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:44:47,716 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:44:47,716 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:44:47,717 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:44:47,718 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:44:47,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:44:47,720 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:44:47,721 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:44:47,722 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:44:47,722 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:44:47,723 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:44:47,723 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:44:47,724 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:44:47,724 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:44:47,725 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:44:47,726 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:44:47,727 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:44:47,728 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:44:47,728 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:44:47,729 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:44:47,731 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:44:47,731 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:44:47,732 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:44:47,732 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:44:47,733 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:44:47,733 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:44:47,734 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:44:47,734 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:44:47,734 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:44:47,735 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:44:47,735 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:44:47,735 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:44:47,736 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:44:47,736 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:44:47,736 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6803d588-fb2f-48a6-83e9-671168fc30e1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 11:44:47,744 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:44:47,745 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:44:47,746 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:44:47,746 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:44:47,746 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:44:47,746 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:44:47,746 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:44:47,746 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:44:47,747 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:44:47,747 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:44:47,747 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:44:47,747 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:44:47,747 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:44:47,747 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:44:47,747 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:44:47,748 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:44:47,748 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:44:47,748 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:44:47,748 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:44:47,748 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:44:47,750 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:44:47,750 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:44:47,750 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:44:47,750 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:44:47,751 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:44:47,751 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:44:47,751 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:44:47,752 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:44:47,752 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_6803d588-fb2f-48a6-83e9-671168fc30e1/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 -> 27b51ff95b1c87aada11269295eff3fc5c30957f [2018-11-10 11:44:47,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:44:47,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:44:47,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:44:47,790 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:44:47,790 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:44:47,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6803d588-fb2f-48a6-83e9-671168fc30e1/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca_true-termination_true-no-overflow.c.i [2018-11-10 11:44:47,838 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6803d588-fb2f-48a6-83e9-671168fc30e1/bin-2019/uautomizer/data/bf17edd09/87dfa9f16b2f4a3fbce4759ffa77c9f3/FLAG5477ab1e8 [2018-11-10 11:44:48,209 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:44:48,210 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6803d588-fb2f-48a6-83e9-671168fc30e1/sv-benchmarks/c/termination-memory-alloca/b.12-alloca_true-termination_true-no-overflow.c.i [2018-11-10 11:44:48,216 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6803d588-fb2f-48a6-83e9-671168fc30e1/bin-2019/uautomizer/data/bf17edd09/87dfa9f16b2f4a3fbce4759ffa77c9f3/FLAG5477ab1e8 [2018-11-10 11:44:48,226 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6803d588-fb2f-48a6-83e9-671168fc30e1/bin-2019/uautomizer/data/bf17edd09/87dfa9f16b2f4a3fbce4759ffa77c9f3 [2018-11-10 11:44:48,229 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:44:48,230 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:44:48,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:44:48,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:44:48,235 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:44:48,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:44:48" (1/1) ... [2018-11-10 11:44:48,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4f6b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:48, skipping insertion in model container [2018-11-10 11:44:48,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:44:48" (1/1) ... [2018-11-10 11:44:48,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:44:48,278 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:44:48,488 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:44:48,497 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:44:48,528 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:44:48,561 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:44:48,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:48 WrapperNode [2018-11-10 11:44:48,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:44:48,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:44:48,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:44:48,562 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:44:48,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:48" (1/1) ... [2018-11-10 11:44:48,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:48" (1/1) ... [2018-11-10 11:44:48,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:44:48,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:44:48,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:44:48,646 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:44:48,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:48" (1/1) ... [2018-11-10 11:44:48,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:48" (1/1) ... [2018-11-10 11:44:48,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:48" (1/1) ... [2018-11-10 11:44:48,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:48" (1/1) ... [2018-11-10 11:44:48,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:48" (1/1) ... [2018-11-10 11:44:48,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:48" (1/1) ... [2018-11-10 11:44:48,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:48" (1/1) ... [2018-11-10 11:44:48,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:44:48,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:44:48,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:44:48,666 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:44:48,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6803d588-fb2f-48a6-83e9-671168fc30e1/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-10 11:44:48,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 11:44:48,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 11:44:48,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:44:48,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:44:48,906 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:44:48,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:44:48 BoogieIcfgContainer [2018-11-10 11:44:48,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:44:48,907 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:44:48,908 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:44:48,910 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:44:48,911 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:44:48,911 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:44:48" (1/3) ... [2018-11-10 11:44:48,912 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19f39c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:44:48, skipping insertion in model container [2018-11-10 11:44:48,912 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:44:48,912 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:48" (2/3) ... [2018-11-10 11:44:48,913 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19f39c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:44:48, skipping insertion in model container [2018-11-10 11:44:48,913 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:44:48,913 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:44:48" (3/3) ... [2018-11-10 11:44:48,915 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.12-alloca_true-termination_true-no-overflow.c.i [2018-11-10 11:44:48,958 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:44:48,959 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:44:48,959 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:44:48,959 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:44:48,959 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:44:48,959 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:44:48,959 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:44:48,959 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:44:48,959 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:44:48,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 11:44:48,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 11:44:48,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:44:48,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:44:48,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 11:44:48,994 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:44:48,994 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:44:48,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 11:44:48,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 11:44:48,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:44:48,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:44:48,996 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 11:44:48,996 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:44:49,003 INFO L793 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 13#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 14#L552-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 23#L553true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 6#L559-3true [2018-11-10 11:44:49,003 INFO L795 eck$LassoCheckResult]: Loop: 6#L559-3true assume true; 8#L555true SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 10#L555-1true test_fun_#t~short7 := test_fun_#t~mem5 > 0; 24#L555-2true assume test_fun_#t~short7; 29#L555-6true assume !!test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 20#L556true SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 21#L556-1true assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8; 17#L559true SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 3#L559-1true assume !(test_fun_#t~mem10 > 0);havoc test_fun_#t~mem10; 6#L559-3true [2018-11-10 11:44:49,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:49,009 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-11-10 11:44:49,010 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:44:49,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:44:49,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:49,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:44:49,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:49,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:49,124 INFO L82 PathProgramCache]: Analyzing trace with hash 925785955, now seen corresponding path program 1 times [2018-11-10 11:44:49,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:44:49,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:44:49,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:49,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:44:49,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:44:49,213 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-10 11:44:49,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:44:49,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:44:49,217 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:44:49,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:44:49,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:44:49,229 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 6 states. [2018-11-10 11:44:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:44:49,360 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-10 11:44:49,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:44:49,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 42 transitions. [2018-11-10 11:44:49,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-10 11:44:49,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 27 states and 30 transitions. [2018-11-10 11:44:49,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 11:44:49,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 11:44:49,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 30 transitions. [2018-11-10 11:44:49,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:44:49,370 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-10 11:44:49,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 30 transitions. [2018-11-10 11:44:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-10 11:44:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 11:44:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-10 11:44:49,397 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-10 11:44:49,397 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-10 11:44:49,397 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:44:49,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2018-11-10 11:44:49,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 11:44:49,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:44:49,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:44:49,399 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 11:44:49,399 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:44:49,399 INFO L793 eck$LassoCheckResult]: Stem: 103#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 98#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 99#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 104#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 100#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 87#L559-3 [2018-11-10 11:44:49,399 INFO L795 eck$LassoCheckResult]: Loop: 87#L559-3 assume true; 94#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 96#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 97#L555-2 assume test_fun_#t~short7; 102#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 109#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 95#L556-1 assume test_fun_#t~mem8 > 0;havoc test_fun_#t~mem8; 89#L557 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 90#L557-1 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 93#L557-2 havoc test_fun_#t~mem9; 87#L559-3 [2018-11-10 11:44:49,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:49,399 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 2 times [2018-11-10 11:44:49,400 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:44:49,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:44:49,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:49,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:44:49,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:49,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:49,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1365560567, now seen corresponding path program 1 times [2018-11-10 11:44:49,436 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:44:49,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:44:49,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:49,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:44:49,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:49,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:49,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1848960983, now seen corresponding path program 1 times [2018-11-10 11:44:49,454 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:44:49,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:44:49,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:49,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:44:49,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:49,801 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-10 11:44:49,911 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:44:49,912 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:44:49,912 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:44:49,912 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:44:49,913 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:44:49,913 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:44:49,913 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:44:49,913 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:44:49,913 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.12-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-10 11:44:49,913 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:44:49,914 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:44:49,929 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-10 11:44:49,933 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-10 11:44:50,200 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2018-11-10 11:44:50,264 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-10 11:44:50,266 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-10 11:44:50,267 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-10 11:44:50,269 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-10 11:44:50,272 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-10 11:44:50,274 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-10 11:44:50,276 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-10 11:44:50,278 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-10 11:44:50,281 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-10 11:44:50,282 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-10 11:44:50,284 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-10 11:44:50,286 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-10 11:44:50,288 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-10 11:44:50,297 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-10 11:44:50,299 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-10 11:44:50,661 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:44:50,665 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:44:50,667 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-10 11:44:50,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:50,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:44:50,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:50,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:50,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:50,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:44:50,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:44:50,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:50,675 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-10 11:44:50,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:50,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:50,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:50,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:50,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:50,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:50,682 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:50,683 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-10 11:44:50,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:50,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:50,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:50,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:50,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:50,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:50,707 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:50,708 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-10 11:44:50,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:50,708 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:44:50,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:50,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:50,712 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:44:50,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:50,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:50,721 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-10 11:44:50,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:50,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:50,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:50,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:50,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:50,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:50,728 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:50,728 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-10 11:44:50,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:50,729 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:44:50,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:50,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:50,731 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:44:50,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:50,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:50,738 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-10 11:44:50,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:50,738 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:44:50,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:50,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:50,740 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:44:50,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:50,749 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:50,749 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-10 11:44:50,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:50,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:50,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:50,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:50,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:50,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:50,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:50,757 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-10 11:44:50,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:50,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:50,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:50,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:50,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:50,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:50,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:50,763 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-10 11:44:50,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:50,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:50,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:50,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:50,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:50,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:50,777 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:44:50,782 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 11:44:50,783 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 11:44:50,784 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:44:50,786 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:44:50,786 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:44:50,787 INFO L519 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-10 11:44:50,839 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed [2018-11-10 11:44:50,843 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 11:44:50,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:44:50,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:44:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:44:50,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:44:50,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:44:50,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 11:44:50,995 INFO L477 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-10 11:44:50,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:44:51,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:44:51,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:44:51,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-11-10 11:44:51,019 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-10 11:44:51,021 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-10 11:44:51,021 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-11-10 11:44:51,117 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 4. Second operand 8 states. Result 69 states and 77 transitions. Complement of second has 15 states. [2018-11-10 11:44:51,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 11:44:51,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 11:44:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2018-11-10 11:44:51,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-10 11:44:51,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:44:51,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-10 11:44:51,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:44:51,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 5 letters. Loop has 20 letters. [2018-11-10 11:44:51,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:44:51,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 77 transitions. [2018-11-10 11:44:51,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-11-10 11:44:51,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 60 states and 68 transitions. [2018-11-10 11:44:51,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-10 11:44:51,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-10 11:44:51,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 68 transitions. [2018-11-10 11:44:51,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:44:51,124 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-11-10 11:44:51,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 68 transitions. [2018-11-10 11:44:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-11-10 11:44:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 11:44:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-11-10 11:44:51,127 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-10 11:44:51,127 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-10 11:44:51,128 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:44:51,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2018-11-10 11:44:51,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-11-10 11:44:51,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:44:51,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:44:51,129 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 11:44:51,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:44:51,129 INFO L793 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 367#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 368#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 376#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 373#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 374#L559-3 assume true; 353#L555 [2018-11-10 11:44:51,129 INFO L795 eck$LassoCheckResult]: Loop: 353#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 390#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 369#L555-2 assume !test_fun_#t~short7; 370#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 395#L555-5 test_fun_#t~short7 := test_fun_#t~mem6 > 0; 394#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 393#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 392#L556-1 assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8; 391#L559 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 342#L559-1 assume !(test_fun_#t~mem10 > 0);havoc test_fun_#t~mem10; 344#L559-3 assume true; 353#L555 [2018-11-10 11:44:51,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:51,129 INFO L82 PathProgramCache]: Analyzing trace with hash 889444104, now seen corresponding path program 1 times [2018-11-10 11:44:51,129 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:44:51,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:44:51,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:51,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:44:51,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:51,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:51,144 INFO L82 PathProgramCache]: Analyzing trace with hash 546641296, now seen corresponding path program 1 times [2018-11-10 11:44:51,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:44:51,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:44:51,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:51,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:44:51,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:44:51,170 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-10 11:44:51,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:44:51,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:44:51,171 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:44:51,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:44:51,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:44:51,172 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-11-10 11:44:51,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:44:51,230 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-10 11:44:51,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:44:51,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 61 transitions. [2018-11-10 11:44:51,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-10 11:44:51,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 49 states and 54 transitions. [2018-11-10 11:44:51,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-10 11:44:51,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-10 11:44:51,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 54 transitions. [2018-11-10 11:44:51,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:44:51,232 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-10 11:44:51,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 54 transitions. [2018-11-10 11:44:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2018-11-10 11:44:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-10 11:44:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-10 11:44:51,235 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-10 11:44:51,235 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-10 11:44:51,236 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 11:44:51,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2018-11-10 11:44:51,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 11:44:51,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:44:51,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:44:51,237 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:44:51,237 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:44:51,237 INFO L793 eck$LassoCheckResult]: Stem: 494#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 487#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 488#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 495#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 489#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 490#L559-3 assume true; 501#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 504#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 491#L555-2 assume !test_fun_#t~short7; 492#L555-4 [2018-11-10 11:44:51,237 INFO L795 eck$LassoCheckResult]: Loop: 492#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 496#L555-5 test_fun_#t~short7 := test_fun_#t~mem6 > 0; 497#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 499#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 502#L556-1 assume test_fun_#t~mem8 > 0;havoc test_fun_#t~mem8; 469#L557 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 470#L557-1 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 480#L557-2 havoc test_fun_#t~mem9; 468#L559-3 assume true; 473#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 482#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 485#L555-2 assume !test_fun_#t~short7; 492#L555-4 [2018-11-10 11:44:51,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:51,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1776064200, now seen corresponding path program 1 times [2018-11-10 11:44:51,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:44:51,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:44:51,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:51,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:44:51,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:51,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:51,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1639730676, now seen corresponding path program 1 times [2018-11-10 11:44:51,257 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:44:51,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:44:51,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:51,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:44:51,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:51,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:51,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1271486035, now seen corresponding path program 1 times [2018-11-10 11:44:51,270 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:44:51,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:44:51,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:51,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:44:51,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:44:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:44:51,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:44:51,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:44:51,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:44:51,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:44:51,408 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-10 11:44:51,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:44:51,452 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-10 11:44:51,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:44:51,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 43 transitions. [2018-11-10 11:44:51,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 11:44:51,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 43 transitions. [2018-11-10 11:44:51,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-10 11:44:51,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-10 11:44:51,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 43 transitions. [2018-11-10 11:44:51,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:44:51,454 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-11-10 11:44:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 43 transitions. [2018-11-10 11:44:51,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-10 11:44:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-10 11:44:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-11-10 11:44:51,456 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-11-10 11:44:51,456 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-11-10 11:44:51,456 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 11:44:51,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 43 transitions. [2018-11-10 11:44:51,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 11:44:51,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:44:51,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:44:51,458 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:44:51,458 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:44:51,458 INFO L793 eck$LassoCheckResult]: Stem: 590#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 584#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 585#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 591#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 586#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 587#L559-3 assume true; 571#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 580#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 582#L555-2 assume !test_fun_#t~short7; 588#L555-4 [2018-11-10 11:44:51,458 INFO L795 eck$LassoCheckResult]: Loop: 588#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 592#L555-5 test_fun_#t~short7 := test_fun_#t~mem6 > 0; 593#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 598#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 597#L556-1 assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8; 596#L559 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 562#L559-1 assume test_fun_#t~mem10 > 0;havoc test_fun_#t~mem10; 563#L560 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 594#L560-1 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560-1 564#L560-2 havoc test_fun_#t~mem11; 565#L559-3 assume true; 601#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 600#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 599#L555-2 assume !test_fun_#t~short7; 588#L555-4 [2018-11-10 11:44:51,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:51,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1776064200, now seen corresponding path program 2 times [2018-11-10 11:44:51,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:44:51,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:44:51,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:51,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:44:51,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:51,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:51,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1189356237, now seen corresponding path program 1 times [2018-11-10 11:44:51,475 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:44:51,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:44:51,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:51,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:44:51,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:51,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:51,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1450061484, now seen corresponding path program 1 times [2018-11-10 11:44:51,488 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:44:51,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:44:51,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:51,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:44:51,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:51,830 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 109 [2018-11-10 11:44:51,943 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-10 11:44:51,944 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:44:51,945 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:44:51,945 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:44:51,945 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:44:51,945 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:44:51,945 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:44:51,945 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:44:51,945 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:44:51,945 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.12-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-10 11:44:51,945 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:44:51,945 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:44:51,949 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-10 11:44:51,953 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-10 11:44:51,955 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-10 11:44:51,956 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-10 11:44:51,958 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-10 11:44:51,959 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-10 11:44:52,204 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 99 [2018-11-10 11:44:52,275 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-10 11:44:52,276 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-10 11:44:52,278 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-10 11:44:52,279 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-10 11:44:52,282 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-10 11:44:52,283 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-10 11:44:52,285 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-10 11:44:52,286 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-10 11:44:52,287 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-10 11:44:52,288 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-10 11:44:52,289 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-10 11:44:52,291 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-10 11:44:52,292 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-10 11:44:52,718 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:44:52,718 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:44:52,718 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-10 11:44:52,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:44:52,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:52,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:44:52,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:44:52,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:52,720 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-10 11:44:52,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:52,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:52,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:52,724 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:52,725 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-10 11:44:52,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:44:52,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:52,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:44:52,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:44:52,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:52,726 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-10 11:44:52,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:52,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:52,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:52,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:52,729 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-10 11:44:52,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:52,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:52,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:52,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:52,734 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-10 11:44:52,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:52,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:52,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:52,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:52,737 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-10 11:44:52,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,738 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:44:52,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,739 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:44:52,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:52,743 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:52,743 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-10 11:44:52,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:52,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:52,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:52,749 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:52,749 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-10 11:44:52,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:52,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:52,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:52,754 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:52,754 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-10 11:44:52,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:52,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:52,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:52,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:52,757 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-10 11:44:52,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,757 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:44:52,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,758 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:44:52,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:52,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:52,765 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-10 11:44:52,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:52,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:52,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:52,768 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:52,768 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-10 11:44:52,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:52,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:52,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:52,785 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:52,786 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-10 11:44:52,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:52,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:52,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:52,792 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:52,793 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-10 11:44:52,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:52,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:52,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:52,800 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:52,800 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-10 11:44:52,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,801 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:44:52,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,802 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:44:52,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:52,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:44:52,805 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-10 11:44:52,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:44:52,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:44:52,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:44:52,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:44:52,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:44:52,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:44:52,811 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:44:52,815 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 11:44:52,815 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 11:44:52,816 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:44:52,816 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:44:52,817 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:44:52,817 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 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 [] [2018-11-10 11:44:52,876 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-10 11:44:52,877 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 11:44:52,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:44:52,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:44:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:44:52,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:44:52,968 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:44:52,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 11:44:52,973 INFO L477 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-10 11:44:52,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:44:52,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:44:52,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:44:52,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-11-10 11:44:52,997 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-10 11:44:52,997 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-10 11:44:52,997 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 43 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-10 11:44:53,080 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 43 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 80 states and 85 transitions. Complement of second has 15 states. [2018-11-10 11:44:53,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 11:44:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 11:44:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-11-10 11:44:53,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 9 letters. Loop has 14 letters. [2018-11-10 11:44:53,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:44:53,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 23 letters. Loop has 14 letters. [2018-11-10 11:44:53,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:44:53,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 9 letters. Loop has 28 letters. [2018-11-10 11:44:53,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:44:53,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 85 transitions. [2018-11-10 11:44:53,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 11:44:53,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 65 states and 69 transitions. [2018-11-10 11:44:53,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-10 11:44:53,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 11:44:53,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 69 transitions. [2018-11-10 11:44:53,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:44:53,085 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-10 11:44:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 69 transitions. [2018-11-10 11:44:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-11-10 11:44:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 11:44:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-10 11:44:53,088 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-10 11:44:53,088 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-10 11:44:53,088 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 11:44:53,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 63 transitions. [2018-11-10 11:44:53,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 11:44:53,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:44:53,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:44:53,090 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:44:53,090 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:44:53,090 INFO L793 eck$LassoCheckResult]: Stem: 917#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 911#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 912#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 918#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 913#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 914#L559-3 assume true; 935#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 941#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 939#L555-2 assume !test_fun_#t~short7; 919#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 920#L555-5 test_fun_#t~short7 := test_fun_#t~mem6 > 0; 923#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 930#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 929#L556-1 assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8; 928#L559 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 886#L559-1 assume test_fun_#t~mem10 > 0;havoc test_fun_#t~mem10; 887#L560 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 925#L560-1 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560-1 890#L560-2 havoc test_fun_#t~mem11; 892#L559-3 assume true; 897#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 905#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 909#L555-2 assume test_fun_#t~short7; 915#L555-6 [2018-11-10 11:44:53,090 INFO L795 eck$LassoCheckResult]: Loop: 915#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 899#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 900#L556-1 assume test_fun_#t~mem8 > 0;havoc test_fun_#t~mem8; 893#L557 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 894#L557-1 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 903#L557-2 havoc test_fun_#t~mem9; 889#L559-3 assume true; 942#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 940#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 938#L555-2 assume test_fun_#t~short7; 915#L555-6 [2018-11-10 11:44:53,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:53,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1450061486, now seen corresponding path program 1 times [2018-11-10 11:44:53,091 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:44:53,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:44:53,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:53,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:44:53,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:44:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:44:53,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:44:53,171 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6803d588-fb2f-48a6-83e9-671168fc30e1/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-10 11:44:53,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:44:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:44:53,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:44:53,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-10 11:44:53,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 11:44:53,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:44:53,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-10 11:44:53,247 INFO L477 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 21 treesize of output 22 [2018-11-10 11:44:53,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 11:44:53,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:44:53,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:44:53,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:44:53,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-11-10 11:44:53,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 11:44:53,286 INFO L477 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 11 treesize of output 7 [2018-11-10 11:44:53,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:44:53,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:44:53,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:44:53,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 11:44:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:44:53,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:44:53,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 11:44:53,324 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:44:53,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:44:53,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1389463223, now seen corresponding path program 2 times [2018-11-10 11:44:53,324 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:44:53,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:44:53,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:53,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:44:53,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:44:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:44:53,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 11:44:53,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:44:53,404 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. cyclomatic complexity: 7 Second operand 10 states. [2018-11-10 11:44:53,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:44:53,512 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-10 11:44:53,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 11:44:53,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 41 transitions. [2018-11-10 11:44:53,513 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:44:53,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2018-11-10 11:44:53,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:44:53,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:44:53,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:44:53,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:44:53,514 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:44:53,514 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:44:53,514 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:44:53,514 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 11:44:53,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:44:53,514 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:44:53,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:44:53,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:44:53 BoogieIcfgContainer [2018-11-10 11:44:53,520 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:44:53,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:44:53,520 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:44:53,520 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:44:53,521 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:44:48" (3/4) ... [2018-11-10 11:44:53,526 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:44:53,526 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:44:53,527 INFO L168 Benchmark]: Toolchain (without parser) took 5297.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 956.6 MB in the beginning and 1.0 GB in the end (delta: -70.8 MB). Peak memory consumption was 121.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:44:53,527 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:44:53,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.47 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:44:53,528 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -205.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:44:53,528 INFO L168 Benchmark]: Boogie Preprocessor took 20.52 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:44:53,529 INFO L168 Benchmark]: RCFGBuilder took 240.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:44:53,529 INFO L168 Benchmark]: BuchiAutomizer took 4612.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.7 MB). Peak memory consumption was 138.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:44:53,530 INFO L168 Benchmark]: Witness Printer took 5.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:44:53,532 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.47 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -205.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.52 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 240.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4612.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.7 MB). Peak memory consumption was 138.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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 * 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] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 8 locations. 4 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 3.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 59 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 106 SDtfs, 172 SDslu, 185 SDs, 0 SdLazy, 340 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital259 mio100 ax107 hnf99 lsp88 ukn84 mio100 lsp39 div100 bol100 ite100 ukn100 eq193 hnf87 smp92 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms 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...