./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/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 b4afea49cf97a69d20f4a5a7301b61ef07ffc206 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 21:45:56,708 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:45:56,709 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:45:56,715 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:45:56,715 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:45:56,715 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:45:56,716 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:45:56,717 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:45:56,718 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:45:56,718 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:45:56,719 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:45:56,719 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:45:56,719 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:45:56,720 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:45:56,720 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:45:56,721 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:45:56,721 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:45:56,722 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:45:56,723 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:45:56,724 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:45:56,724 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:45:56,725 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:45:56,726 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:45:56,726 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:45:56,726 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:45:56,726 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:45:56,727 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:45:56,727 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:45:56,728 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:45:56,728 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:45:56,728 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:45:56,729 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:45:56,729 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:45:56,729 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:45:56,729 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:45:56,730 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:45:56,730 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 21:45:56,737 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:45:56,737 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:45:56,738 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 21:45:56,738 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 21:45:56,738 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 21:45:56,738 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 21:45:56,738 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 21:45:56,738 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 21:45:56,738 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 21:45:56,739 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 21:45:56,739 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 21:45:56,739 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:45:56,739 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 21:45:56,739 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:45:56,739 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:45:56,739 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 21:45:56,739 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 21:45:56,739 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 21:45:56,739 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:45:56,739 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 21:45:56,740 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 21:45:56,740 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 21:45:56,740 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:45:56,740 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:45:56,740 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 21:45:56,740 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:45:56,740 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 21:45:56,740 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 21:45:56,741 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 21:45:56,741 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_e38b0f55-a0cf-4634-bdac-c199184215af/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 -> b4afea49cf97a69d20f4a5a7301b61ef07ffc206 [2018-12-02 21:45:56,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:45:56,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:45:56,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:45:56,768 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:45:56,768 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:45:56,768 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-12-02 21:45:56,805 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/bin-2019/uautomizer/data/4f599ca0c/c70e017f783c48d882e88739d8ea79b9/FLAG852f4fe58 [2018-12-02 21:45:57,168 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:45:57,169 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-12-02 21:45:57,174 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/bin-2019/uautomizer/data/4f599ca0c/c70e017f783c48d882e88739d8ea79b9/FLAG852f4fe58 [2018-12-02 21:45:57,182 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/bin-2019/uautomizer/data/4f599ca0c/c70e017f783c48d882e88739d8ea79b9 [2018-12-02 21:45:57,184 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:45:57,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:45:57,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:45:57,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:45:57,187 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:45:57,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:45:57" (1/1) ... [2018-12-02 21:45:57,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9d864a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:57, skipping insertion in model container [2018-12-02 21:45:57,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:45:57" (1/1) ... [2018-12-02 21:45:57,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:45:57,211 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:45:57,348 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:45:57,355 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:45:57,412 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:45:57,431 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:45:57,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:57 WrapperNode [2018-12-02 21:45:57,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:45:57,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:45:57,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:45:57,432 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:45:57,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:57" (1/1) ... [2018-12-02 21:45:57,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:57" (1/1) ... [2018-12-02 21:45:57,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:45:57,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:45:57,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:45:57,457 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:45:57,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:57" (1/1) ... [2018-12-02 21:45:57,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:57" (1/1) ... [2018-12-02 21:45:57,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:57" (1/1) ... [2018-12-02 21:45:57,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:57" (1/1) ... [2018-12-02 21:45:57,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:57" (1/1) ... [2018-12-02 21:45:57,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:57" (1/1) ... [2018-12-02 21:45:57,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:57" (1/1) ... [2018-12-02 21:45:57,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:45:57,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:45:57,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:45:57,470 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:45:57,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/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-12-02 21:45:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:45:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 21:45:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 21:45:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:45:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:45:57,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:45:57,629 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:45:57,629 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 21:45:57,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:45:57 BoogieIcfgContainer [2018-12-02 21:45:57,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:45:57,629 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 21:45:57,630 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 21:45:57,632 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 21:45:57,632 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 21:45:57,632 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 09:45:57" (1/3) ... [2018-12-02 21:45:57,633 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d715273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 09:45:57, skipping insertion in model container [2018-12-02 21:45:57,633 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 21:45:57,633 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:57" (2/3) ... [2018-12-02 21:45:57,633 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d715273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 09:45:57, skipping insertion in model container [2018-12-02 21:45:57,633 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 21:45:57,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:45:57" (3/3) ... [2018-12-02 21:45:57,635 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-12-02 21:45:57,666 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 21:45:57,666 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 21:45:57,666 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 21:45:57,666 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 21:45:57,667 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:45:57,667 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:45:57,667 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 21:45:57,667 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:45:57,667 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 21:45:57,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-02 21:45:57,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 21:45:57,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:45:57,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:45:57,692 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 21:45:57,692 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 21:45:57,692 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 21:45:57,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-02 21:45:57,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 21:45:57,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:45:57,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:45:57,693 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 21:45:57,693 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 21:45:57,700 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 12#L553-3true [2018-12-02 21:45:57,700 INFO L796 eck$LassoCheckResult]: Loop: 12#L553-3true call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 9#L553-1true assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 13#L555-5true assume !true; 16#L555-6true call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 12#L553-3true [2018-12-02 21:45:57,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:45:57,704 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 21:45:57,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:45:57,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:45:57,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:57,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:45:57,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:57,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:45:57,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1144712, now seen corresponding path program 1 times [2018-12-02 21:45:57,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:45:57,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:45:57,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:57,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:45:57,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:45:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:45:57,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:45:57,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:45:57,810 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 21:45:57,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 21:45:57,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 21:45:57,820 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-12-02 21:45:57,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:45:57,824 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-12-02 21:45:57,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 21:45:57,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-12-02 21:45:57,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 21:45:57,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 11 transitions. [2018-12-02 21:45:57,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 21:45:57,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 21:45:57,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-12-02 21:45:57,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 21:45:57,829 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-02 21:45:57,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-12-02 21:45:57,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-02 21:45:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 21:45:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-02 21:45:57,846 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-02 21:45:57,846 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-02 21:45:57,846 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 21:45:57,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-12-02 21:45:57,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 21:45:57,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:45:57,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:45:57,846 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 21:45:57,846 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 21:45:57,847 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 37#L553-3 [2018-12-02 21:45:57,847 INFO L796 eck$LassoCheckResult]: Loop: 37#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 39#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 40#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 44#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 41#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 42#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 37#L553-3 [2018-12-02 21:45:57,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:45:57,847 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-02 21:45:57,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:45:57,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:45:57,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:57,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:45:57,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:57,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:45:57,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1099516500, now seen corresponding path program 1 times [2018-12-02 21:45:57,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:45:57,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:45:57,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:57,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:45:57,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:45:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:45:57,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:45:57,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:45:57,907 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 21:45:57,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:45:57,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:45:57,907 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-12-02 21:45:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:45:57,951 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-02 21:45:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:45:57,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-12-02 21:45:57,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-02 21:45:57,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2018-12-02 21:45:57,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 21:45:57,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 21:45:57,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2018-12-02 21:45:57,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 21:45:57,953 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-02 21:45:57,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2018-12-02 21:45:57,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-12-02 21:45:57,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-02 21:45:57,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-12-02 21:45:57,955 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-12-02 21:45:57,955 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-12-02 21:45:57,955 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 21:45:57,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2018-12-02 21:45:57,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-02 21:45:57,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:45:57,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:45:57,955 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 21:45:57,956 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 21:45:57,956 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 73#L553-3 [2018-12-02 21:45:57,956 INFO L796 eck$LassoCheckResult]: Loop: 73#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 75#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 76#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 80#L555-1 assume !test_fun_#t~short8; 83#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 81#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 73#L553-3 [2018-12-02 21:45:57,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:45:57,956 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-02 21:45:57,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:45:57,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:45:57,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:57,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:45:57,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:57,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:45:57,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1099518422, now seen corresponding path program 1 times [2018-12-02 21:45:57,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:45:57,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:45:57,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:57,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:45:57,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:57,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:45:57,982 INFO L82 PathProgramCache]: Analyzing trace with hash 179567640, now seen corresponding path program 1 times [2018-12-02 21:45:57,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:45:57,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:45:57,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:57,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:45:57,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:58,235 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 21:45:58,236 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 21:45:58,236 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 21:45:58,236 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 21:45:58,236 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 21:45:58,237 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 21:45:58,237 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 21:45:58,237 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 21:45:58,237 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-12-02 21:45:58,237 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 21:45:58,237 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 21:45:58,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:58,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:58,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:58,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:58,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:58,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:58,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:58,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:58,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:58,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-12-02 21:45:58,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-12-02 21:45:58,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:58,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-12-02 21:45:58,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:58,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:58,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:58,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:58,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:58,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:58,644 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 21:45:58,647 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 21:45:58,649 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-12-02 21:45:58,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:58,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:58,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:58,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,653 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-12-02 21:45:58,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:58,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:58,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:58,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,655 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-12-02 21:45:58,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:58,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:58,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:58,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,657 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-12-02 21:45:58,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:58,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:58,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:58,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,659 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-12-02 21:45:58,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:58,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:58,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:58,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,660 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-12-02 21:45:58,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:45:58,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:58,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,664 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-12-02 21:45:58,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:58,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:58,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:58,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,666 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-12-02 21:45:58,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:58,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:58,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:58,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,668 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-12-02 21:45:58,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:45:58,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:58,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,673 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-12-02 21:45:58,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:58,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:58,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:58,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,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-12-02 21:45:58,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:45:58,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:58,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,678 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-12-02 21:45:58,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:58,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:58,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:58,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,680 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-12-02 21:45:58,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:58,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:58,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:58,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,681 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-12-02 21:45:58,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:58,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:58,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:58,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,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-12-02 21:45:58,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,684 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:45:58,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,692 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:45:58,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:58,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,698 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-12-02 21:45:58,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:45:58,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:58,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,705 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-12-02 21:45:58,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:45:58,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:58,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,711 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-12-02 21:45:58,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:45:58,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:58,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,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-12-02 21:45:58,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:45:58,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:58,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,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-12-02 21:45:58,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,721 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:45:58,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,722 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:45:58,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:58,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:58,727 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-12-02 21:45:58,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:58,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:58,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:58,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:58,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:45:58,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:58,733 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 21:45:58,738 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 21:45:58,738 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 21:45:58,739 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 21:45:58,740 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 21:45:58,740 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 21:45:58,740 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1 Supporting invariants [] [2018-12-02 21:45:58,760 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-12-02 21:45:58,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 21:45:58,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:45:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:45:58,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:45:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:45:58,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:45:58,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-02 21:45:58,832 INFO L478 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 8 treesize of output 7 [2018-12-02 21:45:58,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:45:58,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:45:58,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:45:58,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-12-02 21:45:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:45:58,863 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 21:45:58,863 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-12-02 21:45:58,922 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 31 states and 40 transitions. Complement of second has 8 states. [2018-12-02 21:45:58,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 21:45:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 21:45:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-12-02 21:45:58,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-02 21:45:58,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:45:58,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-02 21:45:58,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:45:58,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2018-12-02 21:45:58,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:45:58,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2018-12-02 21:45:58,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-02 21:45:58,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 39 transitions. [2018-12-02 21:45:58,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-02 21:45:58,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-02 21:45:58,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2018-12-02 21:45:58,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:45:58,927 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2018-12-02 21:45:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2018-12-02 21:45:58,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-12-02 21:45:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-02 21:45:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2018-12-02 21:45:58,929 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-12-02 21:45:58,929 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-12-02 21:45:58,929 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 21:45:58,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2018-12-02 21:45:58,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-02 21:45:58,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:45:58,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:45:58,930 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 21:45:58,930 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 21:45:58,931 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 215#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 216#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2018-12-02 21:45:58,931 INFO L796 eck$LassoCheckResult]: Loop: 222#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 223#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 228#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 218#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 219#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 226#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 237#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 236#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 232#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 230#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2018-12-02 21:45:58,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:45:58,931 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-02 21:45:58,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:45:58,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:45:58,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:58,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:45:58,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:58,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:45:58,941 INFO L82 PathProgramCache]: Analyzing trace with hash 15750502, now seen corresponding path program 1 times [2018-12-02 21:45:58,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:45:58,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:45:58,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:58,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:45:58,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:45:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:45:58,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:45:58,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/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-12-02 21:45:58,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:45:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:45:59,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:45:59,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 21:45:59,004 INFO L478 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 8 treesize of output 7 [2018-12-02 21:45:59,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:45:59,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:45:59,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:45:59,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 21:45:59,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:45:59,010 INFO L478 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 25 treesize of output 28 [2018-12-02 21:45:59,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:45:59,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-02 21:45:59,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:45:59,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:45:59,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:45:59,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 21:45:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:45:59,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:45:59,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-12-02 21:45:59,051 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 21:45:59,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:45:59,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:45:59,052 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-12-02 21:45:59,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:45:59,114 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2018-12-02 21:45:59,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:45:59,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 60 transitions. [2018-12-02 21:45:59,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-12-02 21:45:59,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 60 transitions. [2018-12-02 21:45:59,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-02 21:45:59,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-02 21:45:59,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2018-12-02 21:45:59,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:45:59,117 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-12-02 21:45:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2018-12-02 21:45:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-12-02 21:45:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 21:45:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2018-12-02 21:45:59,119 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2018-12-02 21:45:59,119 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2018-12-02 21:45:59,119 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 21:45:59,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2018-12-02 21:45:59,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-02 21:45:59,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:45:59,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:45:59,120 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 21:45:59,120 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:45:59,120 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 330#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2018-12-02 21:45:59,120 INFO L796 eck$LassoCheckResult]: Loop: 332#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 333#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 344#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 336#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 337#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 340#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 353#L555-1 assume !test_fun_#t~short8; 350#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 346#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 342#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2018-12-02 21:45:59,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:45:59,121 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-12-02 21:45:59,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:45:59,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:45:59,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:59,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:45:59,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:59,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:45:59,132 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 1 times [2018-12-02 21:45:59,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:45:59,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:45:59,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:59,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:45:59,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:59,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:45:59,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 1 times [2018-12-02 21:45:59,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:45:59,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:45:59,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:59,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:45:59,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:45:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:45:59,307 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2018-12-02 21:45:59,459 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 21:45:59,459 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 21:45:59,459 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 21:45:59,460 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 21:45:59,460 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 21:45:59,460 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 21:45:59,460 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 21:45:59,460 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 21:45:59,460 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-12-02 21:45:59,460 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 21:45:59,460 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 21:45:59,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:45:59,794 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 21:45:59,794 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 21:45:59,795 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-12-02 21:45:59,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:59,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:59,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:59,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:59,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:59,796 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-12-02 21:45:59,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:59,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:59,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:59,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:59,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:59,798 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-12-02 21:45:59,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:59,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:45:59,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:59,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:59,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-12-02 21:45:59,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:59,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:59,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:59,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:59,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:59,801 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-12-02 21:45:59,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:59,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:59,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:59,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:59,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:59,802 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-12-02 21:45:59,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:59,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:59,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:59,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:59,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:59,803 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-12-02 21:45:59,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:59,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:45:59,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:59,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:59,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-12-02 21:45:59,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:59,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:45:59,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:59,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:59,808 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-12-02 21:45:59,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:59,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:59,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:59,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:59,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:59,810 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-12-02 21:45:59,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:59,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:59,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:59,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:59,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:59,812 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-12-02 21:45:59,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:45:59,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:59,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:45:59,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:45:59,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:59,814 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-12-02 21:45:59,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:59,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:45:59,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:59,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:59,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:45:59,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:59,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:45:59,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:59,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:59,831 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-12-02 21:45:59,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:59,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:45:59,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:59,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:59,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:45:59,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:59,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:45:59,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:59,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:59,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 21:45:59,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,842 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:45:59,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,843 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:45:59,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:59,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:45:59,845 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-12-02 21:45:59,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:45:59,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:45:59,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:45:59,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:45:59,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:45:59,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:45:59,852 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 21:45:59,857 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 21:45:59,857 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 21:45:59,858 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 21:45:59,858 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 21:45:59,858 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 21:45:59,858 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-12-02 21:45:59,883 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-02 21:45:59,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 21:45:59,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:45:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:45:59,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:45:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:45:59,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:45:59,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-12-02 21:45:59,928 INFO L478 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 20 treesize of output 19 [2018-12-02 21:45:59,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:45:59,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-12-02 21:45:59,950 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 21:45:59,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:45:59,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:45:59,970 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:30 [2018-12-02 21:46:00,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:00,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 64 [2018-12-02 21:46:00,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:00,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2018-12-02 21:46:00,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:00,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:00,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:00,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:00,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-12-02 21:46:00,096 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:00,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:46:00,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:46:00,121 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:52, output treesize:56 [2018-12-02 21:46:00,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:00,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-12-02 21:46:00,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:00,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2018-12-02 21:46:00,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:00,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:00,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:00,289 INFO L478 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 54 treesize of output 49 [2018-12-02 21:46:00,291 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:46:00,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:00,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-12-02 21:46:00,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:00,300 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:00,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 21:46:00,310 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:109, output treesize:60 [2018-12-02 21:46:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:46:00,338 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-12-02 21:46:00,338 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13 Second operand 10 states. [2018-12-02 21:46:00,618 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13. Second operand 10 states. Result 118 states and 150 transitions. Complement of second has 19 states. [2018-12-02 21:46:00,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-12-02 21:46:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-02 21:46:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2018-12-02 21:46:00,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 10 letters. [2018-12-02 21:46:00,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:46:00,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 13 letters. Loop has 10 letters. [2018-12-02 21:46:00,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:46:00,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 20 letters. [2018-12-02 21:46:00,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:46:00,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 150 transitions. [2018-12-02 21:46:00,621 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-12-02 21:46:00,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 113 states and 145 transitions. [2018-12-02 21:46:00,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-02 21:46:00,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-12-02 21:46:00,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 145 transitions. [2018-12-02 21:46:00,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:46:00,622 INFO L705 BuchiCegarLoop]: Abstraction has 113 states and 145 transitions. [2018-12-02 21:46:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 145 transitions. [2018-12-02 21:46:00,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2018-12-02 21:46:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 21:46:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 131 transitions. [2018-12-02 21:46:00,625 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2018-12-02 21:46:00,625 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2018-12-02 21:46:00,625 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 21:46:00,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 131 transitions. [2018-12-02 21:46:00,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2018-12-02 21:46:00,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:46:00,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:46:00,626 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 21:46:00,626 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-12-02 21:46:00,627 INFO L794 eck$LassoCheckResult]: Stem: 617#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 615#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 616#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 679#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2018-12-02 21:46:00,627 INFO L796 eck$LassoCheckResult]: Loop: 619#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 637#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 622#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 623#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 626#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 629#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 662#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 659#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 658#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 642#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 643#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 634#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 631#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 618#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2018-12-02 21:46:00,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:00,627 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-12-02 21:46:00,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:00,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:00,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:00,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:46:00,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:00,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:00,636 INFO L82 PathProgramCache]: Analyzing trace with hash 527155748, now seen corresponding path program 2 times [2018-12-02 21:46:00,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:00,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:00,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:00,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:46:00,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:00,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:00,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1781235253, now seen corresponding path program 1 times [2018-12-02 21:46:00,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:00,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:00,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:00,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:46:00,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:46:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:46:00,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:46:00,716 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:46:00,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:46:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:46:00,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:46:00,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 21:46:00,750 INFO L478 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 8 treesize of output 7 [2018-12-02 21:46:00,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:00,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:00,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:00,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 21:46:00,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:00,755 INFO L478 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 25 treesize of output 28 [2018-12-02 21:46:00,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:00,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-02 21:46:00,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:00,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:00,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:00,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 21:46:00,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:00,772 INFO L478 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 25 treesize of output 28 [2018-12-02 21:46:00,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:00,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-02 21:46:00,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:00,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:00,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:00,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 21:46:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:46:00,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:46:00,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-12-02 21:46:01,028 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 95 [2018-12-02 21:46:01,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:46:01,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:46:01,055 INFO L87 Difference]: Start difference. First operand 99 states and 131 transitions. cyclomatic complexity: 38 Second operand 9 states. [2018-12-02 21:46:01,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:46:01,138 INFO L93 Difference]: Finished difference Result 141 states and 177 transitions. [2018-12-02 21:46:01,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:46:01,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 177 transitions. [2018-12-02 21:46:01,140 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-12-02 21:46:01,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 175 transitions. [2018-12-02 21:46:01,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-12-02 21:46:01,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2018-12-02 21:46:01,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 175 transitions. [2018-12-02 21:46:01,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:46:01,142 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 175 transitions. [2018-12-02 21:46:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 175 transitions. [2018-12-02 21:46:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2018-12-02 21:46:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 21:46:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2018-12-02 21:46:01,147 INFO L728 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2018-12-02 21:46:01,147 INFO L608 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2018-12-02 21:46:01,147 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 21:46:01,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 143 transitions. [2018-12-02 21:46:01,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-12-02 21:46:01,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:46:01,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:46:01,148 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 21:46:01,148 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-02 21:46:01,148 INFO L794 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 926#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 927#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 985#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2018-12-02 21:46:01,148 INFO L796 eck$LassoCheckResult]: Loop: 930#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 943#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 968#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 966#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 967#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 947#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 933#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 934#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 937#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 965#L555-1 assume !test_fun_#t~short8; 981#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 980#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 969#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 929#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2018-12-02 21:46:01,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:01,148 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-12-02 21:46:01,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:01,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:01,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:01,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:46:01,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:01,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:01,156 INFO L82 PathProgramCache]: Analyzing trace with hash 529002790, now seen corresponding path program 2 times [2018-12-02 21:46:01,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:01,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:01,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:01,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:46:01,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:01,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:01,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1779388211, now seen corresponding path program 2 times [2018-12-02 21:46:01,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:01,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:01,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:01,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:46:01,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:01,456 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 92 [2018-12-02 21:46:01,642 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2018-12-02 21:46:01,698 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 21:46:01,698 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 21:46:01,698 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 21:46:01,698 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 21:46:01,698 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 21:46:01,698 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 21:46:01,698 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 21:46:01,698 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 21:46:01,698 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration7_Lasso [2018-12-02 21:46:01,698 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 21:46:01,698 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 21:46:01,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:01,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:02,020 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 21:46:02,020 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 21:46:02,020 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-12-02 21:46:02,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:02,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:02,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:02,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:02,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:02,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:02,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:02,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:02,023 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-12-02 21:46:02,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:02,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:02,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:02,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:02,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:02,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:02,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:02,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:02,024 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-12-02 21:46:02,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:02,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:02,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:02,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:02,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:02,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:02,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:02,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:02,026 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-12-02 21:46:02,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:02,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:02,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:02,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:02,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:46:02,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:02,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:02,028 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-12-02 21:46:02,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:02,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:02,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:02,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:02,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:02,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:02,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:02,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:02,030 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-12-02 21:46:02,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:02,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:02,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:02,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:02,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:02,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:02,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:02,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:02,031 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-12-02 21:46:02,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:02,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:02,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:02,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:02,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:46:02,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:02,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:02,036 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-12-02 21:46:02,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:02,036 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:46:02,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:02,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:02,037 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:46:02,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:02,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:02,040 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-12-02 21:46:02,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:02,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:02,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:02,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:02,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:46:02,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:02,052 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 21:46:02,063 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 21:46:02,064 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 21:46:02,064 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 21:46:02,065 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 21:46:02,065 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 21:46:02,065 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-12-02 21:46:02,091 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-02 21:46:02,091 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 21:46:02,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:46:02,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:46:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:46:02,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:46:02,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:02,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 59 [2018-12-02 21:46:02,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:02,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:02,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:02,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2018-12-02 21:46:02,168 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:46:02,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:02,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-12-02 21:46:02,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:46:02,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 21:46:02,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 21:46:02,248 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:45, output treesize:114 [2018-12-02 21:46:02,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:02,309 INFO L478 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 53 treesize of output 52 [2018-12-02 21:46:02,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:02,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-12-02 21:46:02,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:02,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:02,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:02,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-12-02 21:46:02,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:02,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-12-02 21:46:02,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:02,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:02,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 21:46:02,371 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2018-12-02 21:46:02,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:02,404 INFO L478 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 53 treesize of output 52 [2018-12-02 21:46:02,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:02,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-12-02 21:46:02,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:02,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:02,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:02,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-12-02 21:46:02,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:02,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-12-02 21:46:02,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:02,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:02,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 21:46:02,470 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2018-12-02 21:46:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:46:02,507 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-12-02 21:46:02,507 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2018-12-02 21:46:03,708 WARN L180 SmtUtils]: Spent 906.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-12-02 21:46:04,844 WARN L180 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 25 [2018-12-02 21:46:05,872 WARN L180 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2018-12-02 21:46:05,883 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 281 states and 357 transitions. Complement of second has 27 states. [2018-12-02 21:46:05,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-12-02 21:46:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 21:46:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2018-12-02 21:46:05,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 32 transitions. Stem has 4 letters. Loop has 14 letters. [2018-12-02 21:46:05,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:46:05,884 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 21:46:05,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:46:05,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:46:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:46:05,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:46:05,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:05,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 59 [2018-12-02 21:46:05,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:05,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-12-02 21:46:05,947 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:46:05,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:05,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:05,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:05,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2018-12-02 21:46:05,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:46:06,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 21:46:06,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 21:46:06,021 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:45, output treesize:114 [2018-12-02 21:46:06,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:06,072 INFO L478 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 53 treesize of output 52 [2018-12-02 21:46:06,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:06,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-12-02 21:46:06,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:06,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:06,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:06,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-12-02 21:46:06,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:06,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-12-02 21:46:06,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:06,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:06,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 21:46:06,124 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2018-12-02 21:46:06,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:06,154 INFO L478 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 53 treesize of output 52 [2018-12-02 21:46:06,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:06,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-12-02 21:46:06,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:06,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:06,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:06,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-12-02 21:46:06,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:06,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-12-02 21:46:06,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:06,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:06,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 21:46:06,216 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2018-12-02 21:46:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:46:06,243 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2018-12-02 21:46:06,243 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2018-12-02 21:46:07,188 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-12-02 21:46:07,494 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 353 states and 447 transitions. Complement of second has 29 states. [2018-12-02 21:46:07,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2018-12-02 21:46:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 21:46:07,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 33 transitions. [2018-12-02 21:46:07,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 4 letters. Loop has 14 letters. [2018-12-02 21:46:07,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:46:07,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 18 letters. Loop has 14 letters. [2018-12-02 21:46:07,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:46:07,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 4 letters. Loop has 28 letters. [2018-12-02 21:46:07,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:46:07,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 353 states and 447 transitions. [2018-12-02 21:46:07,499 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2018-12-02 21:46:07,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 353 states to 286 states and 366 transitions. [2018-12-02 21:46:07,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-12-02 21:46:07,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-12-02 21:46:07,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 366 transitions. [2018-12-02 21:46:07,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:46:07,501 INFO L705 BuchiCegarLoop]: Abstraction has 286 states and 366 transitions. [2018-12-02 21:46:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 366 transitions. [2018-12-02 21:46:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 233. [2018-12-02 21:46:07,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-12-02 21:46:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 304 transitions. [2018-12-02 21:46:07,509 INFO L728 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2018-12-02 21:46:07,509 INFO L608 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2018-12-02 21:46:07,510 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 21:46:07,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 304 transitions. [2018-12-02 21:46:07,510 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-12-02 21:46:07,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:46:07,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:46:07,511 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 21:46:07,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 21:46:07,511 INFO L794 eck$LassoCheckResult]: Stem: 1944#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1942#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1943#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1945#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1946#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1959#L555-1 [2018-12-02 21:46:07,511 INFO L796 eck$LassoCheckResult]: Loop: 1959#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 1950#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1951#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 1954#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1959#L555-1 [2018-12-02 21:46:07,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:07,511 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-12-02 21:46:07,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:07,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:07,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:07,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:46:07,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:07,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:07,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 1 times [2018-12-02 21:46:07,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:07,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:07,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:07,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:46:07,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:07,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:07,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1271571777, now seen corresponding path program 1 times [2018-12-02 21:46:07,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:07,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:07,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:07,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:46:07,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:07,816 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2018-12-02 21:46:08,212 WARN L180 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2018-12-02 21:46:08,214 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 21:46:08,214 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 21:46:08,215 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 21:46:08,215 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 21:46:08,215 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 21:46:08,215 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 21:46:08,215 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 21:46:08,215 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 21:46:08,215 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-12-02 21:46:08,215 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 21:46:08,216 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 21:46:08,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:08,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:08,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:08,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:08,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:08,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:08,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:08,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:08,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:08,518 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-12-02 21:46:08,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:08,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:08,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:08,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:08,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:08,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:08,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:08,967 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 21:46:08,967 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 21:46:08,968 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-12-02 21:46:08,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:08,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:08,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:08,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:08,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:08,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:08,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:08,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:08,969 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-12-02 21:46:08,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:08,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:08,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:08,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:08,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:46:08,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:08,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:08,970 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-12-02 21:46:08,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:08,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:08,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:08,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:08,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:08,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:08,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:08,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:08,971 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-12-02 21:46:08,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:08,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:08,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:08,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:08,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:08,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:08,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:08,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:08,972 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-12-02 21:46:08,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:08,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:08,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:08,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:08,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:46:08,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:08,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:08,973 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-12-02 21:46:08,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:08,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:08,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:08,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:08,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:08,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:08,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:08,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:08,974 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-12-02 21:46:08,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:08,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:08,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:08,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:08,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:08,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:08,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:08,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:08,975 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-12-02 21:46:08,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:08,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:08,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:08,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:08,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:46:08,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:08,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:08,977 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-12-02 21:46:08,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:08,977 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:46:08,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:08,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:08,978 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:46:08,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:08,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:08,979 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-12-02 21:46:08,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:08,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:08,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:08,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:08,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:46:08,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:08,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:08,984 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-12-02 21:46:08,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:08,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:08,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:08,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:08,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:46:08,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:08,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:08,986 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-12-02 21:46:08,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:08,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:08,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:08,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:08,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:46:08,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:08,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:08,988 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-12-02 21:46:08,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:08,988 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:46:08,988 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 21:46:08,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:08,992 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-02 21:46:08,992 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 21:46:09,080 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 21:46:09,154 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-02 21:46:09,154 INFO L444 ModelExtractionUtils]: 35 out of 46 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-12-02 21:46:09,154 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 21:46:09,155 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-02 21:46:09,155 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 21:46:09,155 INFO L520 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)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 + 2147483647 Supporting invariants [] [2018-12-02 21:46:09,182 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-02 21:46:09,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 21:46:09,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:46:09,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:46:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:46:09,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:46:09,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:09,236 INFO L478 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 43 treesize of output 42 [2018-12-02 21:46:09,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:09,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2018-12-02 21:46:09,239 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:46:09,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:46:09,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:46:09,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2018-12-02 21:46:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:46:09,260 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-02 21:46:09,260 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84 Second operand 5 states. [2018-12-02 21:46:09,284 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84. Second operand 5 states. Result 372 states and 485 transitions. Complement of second has 9 states. [2018-12-02 21:46:09,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 21:46:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 21:46:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-12-02 21:46:09,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-02 21:46:09,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:46:09,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-02 21:46:09,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:46:09,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-02 21:46:09,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:46:09,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 485 transitions. [2018-12-02 21:46:09,288 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-12-02 21:46:09,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 317 states and 410 transitions. [2018-12-02 21:46:09,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-12-02 21:46:09,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-12-02 21:46:09,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 410 transitions. [2018-12-02 21:46:09,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:46:09,290 INFO L705 BuchiCegarLoop]: Abstraction has 317 states and 410 transitions. [2018-12-02 21:46:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 410 transitions. [2018-12-02 21:46:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 266. [2018-12-02 21:46:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-02 21:46:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2018-12-02 21:46:09,295 INFO L728 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2018-12-02 21:46:09,295 INFO L608 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2018-12-02 21:46:09,295 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 21:46:09,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 349 transitions. [2018-12-02 21:46:09,296 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-12-02 21:46:09,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:46:09,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:46:09,297 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:46:09,297 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:46:09,297 INFO L794 eck$LassoCheckResult]: Stem: 2649#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2647#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2648#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2664#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2835#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2796#L555-1 assume !test_fun_#t~short8; 2725#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 2678#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2675#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2676#L553-1 [2018-12-02 21:46:09,297 INFO L796 eck$LassoCheckResult]: Loop: 2676#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2724#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2714#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2650#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2651#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 2696#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2681#L555-1 assume !test_fun_#t~short8; 2683#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 2667#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2668#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2676#L553-1 [2018-12-02 21:46:09,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:09,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629551, now seen corresponding path program 2 times [2018-12-02 21:46:09,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:09,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:09,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:09,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:46:09,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:09,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:09,305 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 3 times [2018-12-02 21:46:09,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:09,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:09,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:09,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:46:09,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:09,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:09,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1831564178, now seen corresponding path program 3 times [2018-12-02 21:46:09,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:09,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:09,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:09,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:46:09,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:46:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:46:09,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:46:09,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:46:09,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:46:09,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 21:46:09,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:46:09,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:46:09,421 INFO L478 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-12-02 21:46:09,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:09,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:09,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-12-02 21:46:09,429 INFO L478 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 11 treesize of output 8 [2018-12-02 21:46:09,430 INFO L478 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 8 treesize of output 7 [2018-12-02 21:46:09,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:09,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:09,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:09,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-02 21:46:09,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:09,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-12-02 21:46:09,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:09,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-12-02 21:46:09,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:09,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:09,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:09,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2018-12-02 21:46:09,505 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:46:09,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-12-02 21:46:09,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 25 treesize of output 15 [2018-12-02 21:46:09,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:09,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:09,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:09,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2018-12-02 21:46:09,549 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:46:09,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:46:09,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-12-02 21:46:09,667 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2018-12-02 21:46:09,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:46:09,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:46:09,687 INFO L87 Difference]: Start difference. First operand 266 states and 349 transitions. cyclomatic complexity: 98 Second operand 13 states. [2018-12-02 21:46:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:46:09,762 INFO L93 Difference]: Finished difference Result 313 states and 355 transitions. [2018-12-02 21:46:09,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:46:09,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 355 transitions. [2018-12-02 21:46:09,763 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2018-12-02 21:46:09,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 139 states and 158 transitions. [2018-12-02 21:46:09,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-12-02 21:46:09,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-12-02 21:46:09,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 158 transitions. [2018-12-02 21:46:09,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:46:09,764 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 158 transitions. [2018-12-02 21:46:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 158 transitions. [2018-12-02 21:46:09,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2018-12-02 21:46:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-02 21:46:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2018-12-02 21:46:09,767 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2018-12-02 21:46:09,767 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2018-12-02 21:46:09,767 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 21:46:09,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 149 transitions. [2018-12-02 21:46:09,767 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-12-02 21:46:09,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:46:09,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:46:09,768 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:46:09,768 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-02 21:46:09,768 INFO L794 eck$LassoCheckResult]: Stem: 3306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3304#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3305#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3351#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3350#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3345#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3346#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3341#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3342#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3338#L555-1 assume !test_fun_#t~short8; 3337#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 3336#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3334#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3322#L553-1 [2018-12-02 21:46:09,768 INFO L796 eck$LassoCheckResult]: Loop: 3322#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3401#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3398#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3396#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3394#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3391#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3389#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3386#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3387#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3380#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3381#L555-1 assume !test_fun_#t~short8; 3332#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 3333#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3321#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3322#L553-1 [2018-12-02 21:46:09,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:09,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 4 times [2018-12-02 21:46:09,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:09,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:09,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:09,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:46:09,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:09,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:09,776 INFO L82 PathProgramCache]: Analyzing trace with hash 535533500, now seen corresponding path program 4 times [2018-12-02 21:46:09,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:09,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:09,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:09,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:46:09,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:09,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:09,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1585620926, now seen corresponding path program 5 times [2018-12-02 21:46:09,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:09,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:09,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:09,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:46:09,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:46:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:46:09,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:46:09,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e38b0f55-a0cf-4634-bdac-c199184215af/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:46:09,918 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 21:46:09,937 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-12-02 21:46:09,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:46:09,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:46:09,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 21:46:09,943 INFO L478 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 8 treesize of output 7 [2018-12-02 21:46:09,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:09,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:09,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:09,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 21:46:09,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:09,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 54 [2018-12-02 21:46:09,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:09,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2018-12-02 21:46:09,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:10,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:10,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:10,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:10,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2018-12-02 21:46:10,011 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:10,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:46:10,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:46:10,029 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:42 [2018-12-02 21:46:10,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:10,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-12-02 21:46:10,109 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:46:10,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:10,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-12-02 21:46:10,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:10,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:10,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:10,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-12-02 21:46:10,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:10,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-12-02 21:46:10,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:10,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:46:10,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:46:10,161 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:47 [2018-12-02 21:46:10,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:10,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 51 [2018-12-02 21:46:10,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2018-12-02 21:46:10,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:10,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:10,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:10,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:10,216 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:46:10,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2018-12-02 21:46:10,217 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:46:10,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:46:10,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:46:10,238 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:39, output treesize:49 [2018-12-02 21:46:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 21:46:10,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:46:10,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-12-02 21:46:10,542 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2018-12-02 21:46:10,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 21:46:10,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-12-02 21:46:10,563 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. cyclomatic complexity: 27 Second operand 21 states. [2018-12-02 21:46:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:46:10,785 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-12-02 21:46:10,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 21:46:10,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 113 transitions. [2018-12-02 21:46:10,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 21:46:10,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 69 states and 78 transitions. [2018-12-02 21:46:10,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-12-02 21:46:10,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-12-02 21:46:10,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 78 transitions. [2018-12-02 21:46:10,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 21:46:10,786 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 78 transitions. [2018-12-02 21:46:10,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 78 transitions. [2018-12-02 21:46:10,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2018-12-02 21:46:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 21:46:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-12-02 21:46:10,787 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-12-02 21:46:10,787 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-12-02 21:46:10,787 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 21:46:10,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 49 transitions. [2018-12-02 21:46:10,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 21:46:10,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:46:10,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:46:10,788 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-02 21:46:10,788 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 21:46:10,788 INFO L794 eck$LassoCheckResult]: Stem: 3664#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3662#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3663#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3669#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3670#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3700#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3699#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3698#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3697#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3696#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3695#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3694#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3693#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3682#L555-1 assume !test_fun_#t~short8; 3680#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 3679#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3678#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3671#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3672#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3676#L555-1 [2018-12-02 21:46:10,789 INFO L796 eck$LassoCheckResult]: Loop: 3676#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3665#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3666#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3673#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3676#L555-1 [2018-12-02 21:46:10,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:10,789 INFO L82 PathProgramCache]: Analyzing trace with hash 673540324, now seen corresponding path program 6 times [2018-12-02 21:46:10,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:10,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:10,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:10,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:46:10,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:10,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:10,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 2 times [2018-12-02 21:46:10,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:10,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:10,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:10,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:46:10,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:10,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:10,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1405606780, now seen corresponding path program 7 times [2018-12-02 21:46:10,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:46:10,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:46:10,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:10,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:46:10,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:46:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:46:12,164 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 198 DAG size of output: 150 [2018-12-02 21:46:12,250 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 21:46:12,250 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 21:46:12,250 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 21:46:12,250 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 21:46:12,250 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 21:46:12,250 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 21:46:12,250 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 21:46:12,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 21:46:12,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration11_Lasso [2018-12-02 21:46:12,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 21:46:12,250 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 21:46:12,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:12,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:12,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:12,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:12,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:12,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:12,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:12,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:12,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:12,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-12-02 21:46:12,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-12-02 21:46:12,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-12-02 21:46:12,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:12,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:12,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-12-02 21:46:12,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:12,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-12-02 21:46:12,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:46:12,724 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 21:46:12,724 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 21:46:12,724 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-12-02 21:46:12,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:12,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:12,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:12,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,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-12-02 21:46:12,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:46:12,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:12,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,727 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-12-02 21:46:12,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:46:12,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:12,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,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-12-02 21:46:12,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:12,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:12,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:12,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,731 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-12-02 21:46:12,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:12,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:12,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:12,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,732 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-12-02 21:46:12,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:46:12,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:12,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,735 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-12-02 21:46:12,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:12,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:12,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:12,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,736 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-12-02 21:46:12,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:12,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:12,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:12,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,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-12-02 21:46:12,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:12,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:12,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:12,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,739 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-12-02 21:46:12,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:12,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:12,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:12,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,741 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-12-02 21:46:12,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:46:12,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:12,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,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-12-02 21:46:12,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:12,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:12,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:12,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,752 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-12-02 21:46:12,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:12,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:12,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:12,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,753 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-12-02 21:46:12,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:46:12,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:12,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,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-12-02 21:46:12,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:46:12,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:46:12,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:46:12,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,755 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-12-02 21:46:12,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:46:12,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:12,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,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-12-02 21:46:12,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:46:12,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:12,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,758 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-12-02 21:46:12,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,759 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:46:12,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,759 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:46:12,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:12,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,761 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-12-02 21:46:12,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,761 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:46:12,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:46:12,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,762 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:46:12,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:46:12,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:46:12,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-12-02 21:46:12,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:46:12,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:46:12,763 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 21:46:12,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:46:12,767 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-02 21:46:12,768 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 21:46:12,811 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 21:46:12,854 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-02 21:46:12,854 INFO L444 ModelExtractionUtils]: 37 out of 46 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-02 21:46:12,854 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 21:46:12,855 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-02 21:46:12,855 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 21:46:12,855 INFO L520 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)_5) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 + 2147483647 Supporting invariants [] [2018-12-02 21:46:12,884 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-02 21:46:12,885 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 21:46:12,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:46:12,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:46:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:46:12,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:46:12,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:12,938 INFO L478 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 43 treesize of output 42 [2018-12-02 21:46:12,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:12,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2018-12-02 21:46:12,941 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:46:12,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:46:12,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:46:12,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2018-12-02 21:46:12,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:46:12,961 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-02 21:46:12,961 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-02 21:46:12,987 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 56 states and 66 transitions. Complement of second has 9 states. [2018-12-02 21:46:12,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 21:46:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 21:46:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-12-02 21:46:12,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 19 letters. Loop has 4 letters. [2018-12-02 21:46:12,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:46:12,988 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 21:46:13,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:46:13,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:46:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:46:13,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:46:13,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:13,055 INFO L478 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 43 treesize of output 42 [2018-12-02 21:46:13,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:13,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2018-12-02 21:46:13,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:46:13,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:46:13,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:46:13,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2018-12-02 21:46:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:46:13,078 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-02 21:46:13,079 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-02 21:46:13,111 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 55 states and 64 transitions. Complement of second has 11 states. [2018-12-02 21:46:13,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-02 21:46:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 21:46:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-12-02 21:46:13,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 19 letters. Loop has 4 letters. [2018-12-02 21:46:13,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:46:13,112 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 21:46:13,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:46:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:46:13,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:46:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:46:13,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:46:13,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:13,173 INFO L478 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 43 treesize of output 42 [2018-12-02 21:46:13,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:46:13,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2018-12-02 21:46:13,177 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:46:13,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:46:13,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:46:13,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2018-12-02 21:46:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:46:13,197 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-02 21:46:13,197 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-02 21:46:13,218 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 69 states and 84 transitions. Complement of second has 10 states. [2018-12-02 21:46:13,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 21:46:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 21:46:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-02 21:46:13,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2018-12-02 21:46:13,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:46:13,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 23 letters. Loop has 4 letters. [2018-12-02 21:46:13,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:46:13,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 8 letters. [2018-12-02 21:46:13,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:46:13,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 84 transitions. [2018-12-02 21:46:13,220 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 21:46:13,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2018-12-02 21:46:13,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 21:46:13,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 21:46:13,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 21:46:13,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 21:46:13,221 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:46:13,221 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:46:13,221 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:46:13,221 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 21:46:13,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 21:46:13,221 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 21:46:13,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 21:46:13,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 09:46:13 BoogieIcfgContainer [2018-12-02 21:46:13,227 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 21:46:13,227 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:46:13,227 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:46:13,227 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:46:13,228 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:45:57" (3/4) ... [2018-12-02 21:46:13,231 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 21:46:13,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:46:13,232 INFO L168 Benchmark]: Toolchain (without parser) took 16047.28 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.7 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 130.8 MB. Max. memory is 11.5 GB. [2018-12-02 21:46:13,232 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:46:13,233 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -122.1 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-12-02 21:46:13,233 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.75 ms. Allocated memory is still 1.1 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-12-02 21:46:13,233 INFO L168 Benchmark]: Boogie Preprocessor took 13.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:46:13,233 INFO L168 Benchmark]: RCFGBuilder took 158.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:46:13,234 INFO L168 Benchmark]: BuchiAutomizer took 15597.35 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 206.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -65.2 MB). Peak memory consumption was 140.8 MB. Max. memory is 11.5 GB. [2018-12-02 21:46:13,234 INFO L168 Benchmark]: Witness Printer took 4.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:46:13,236 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -122.1 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.75 ms. Allocated memory is still 1.1 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. * Boogie Preprocessor took 13.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 158.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15597.35 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 206.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -65.2 MB). Peak memory consumption was 140.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + 1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 10 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 15 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.5s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 8.1s. Construction of modules took 0.8s. Büchi inclusion checks took 6.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 206 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 266 states and ocurred in iteration 8. Nontrivial modules had stage [3, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/13 HoareTripleCheckerStatistics: 93 SDtfs, 186 SDslu, 83 SDs, 0 SdLazy, 774 SolverSat, 167 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital364 mio100 ax105 hnf99 lsp82 ukn56 mio100 lsp35 div100 bol105 ite100 ukn100 eq168 hnf89 smp95 dnf172 smp82 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 167ms VariablesStem: 8 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...