./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c09c2c5a-7e36-4dcb-8a0a-1832b19065bc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c09c2c5a-7e36-4dcb-8a0a-1832b19065bc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c09c2c5a-7e36-4dcb-8a0a-1832b19065bc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c09c2c5a-7e36-4dcb-8a0a-1832b19065bc/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c09c2c5a-7e36-4dcb-8a0a-1832b19065bc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c09c2c5a-7e36-4dcb-8a0a-1832b19065bc/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 4eacdd25ec766896c06b3ec61ff2eab4c80478ff .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:38:55,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:38:55,311 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:38:55,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:38:55,320 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:38:55,321 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:38:55,321 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:38:55,323 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:38:55,324 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:38:55,324 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:38:55,325 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:38:55,325 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:38:55,326 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:38:55,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:38:55,327 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:38:55,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:38:55,328 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:38:55,330 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:38:55,331 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:38:55,332 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:38:55,333 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:38:55,333 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:38:55,335 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:38:55,335 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:38:55,335 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:38:55,336 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:38:55,337 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:38:55,337 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:38:55,338 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:38:55,339 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:38:55,339 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:38:55,339 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:38:55,339 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:38:55,340 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:38:55,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:38:55,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:38:55,341 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c09c2c5a-7e36-4dcb-8a0a-1832b19065bc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 05:38:55,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:38:55,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:38:55,353 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:38:55,353 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:38:55,353 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:38:55,353 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:38:55,354 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:38:55,354 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:38:55,354 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:38:55,354 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:38:55,354 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:38:55,354 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:38:55,354 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:38:55,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:38:55,355 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:38:55,355 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:38:55,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:38:55,355 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:38:55,355 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:38:55,355 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:38:55,355 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:38:55,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:38:55,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:38:55,356 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:38:55,356 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:38:55,356 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:38:55,356 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:38:55,357 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:38:55,357 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_c09c2c5a-7e36-4dcb-8a0a-1832b19065bc/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 -> 4eacdd25ec766896c06b3ec61ff2eab4c80478ff [2018-11-10 05:38:55,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:38:55,389 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:38:55,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:38:55,392 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:38:55,392 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:38:55,393 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c09c2c5a-7e36-4dcb-8a0a-1832b19065bc/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca_true-termination_true-no-overflow.c.i [2018-11-10 05:38:55,438 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c09c2c5a-7e36-4dcb-8a0a-1832b19065bc/bin-2019/uautomizer/data/c4c5c5fe3/80ffafec37fc41f4ad1955196d55461d/FLAG71f934b66 [2018-11-10 05:38:55,793 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:38:55,793 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c09c2c5a-7e36-4dcb-8a0a-1832b19065bc/sv-benchmarks/c/termination-memory-alloca/c.03-alloca_true-termination_true-no-overflow.c.i [2018-11-10 05:38:55,802 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c09c2c5a-7e36-4dcb-8a0a-1832b19065bc/bin-2019/uautomizer/data/c4c5c5fe3/80ffafec37fc41f4ad1955196d55461d/FLAG71f934b66 [2018-11-10 05:38:55,811 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c09c2c5a-7e36-4dcb-8a0a-1832b19065bc/bin-2019/uautomizer/data/c4c5c5fe3/80ffafec37fc41f4ad1955196d55461d [2018-11-10 05:38:55,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:38:55,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:38:55,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:38:55,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:38:55,817 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:38:55,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:38:55" (1/1) ... [2018-11-10 05:38:55,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb0e8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:55, skipping insertion in model container [2018-11-10 05:38:55,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:38:55" (1/1) ... [2018-11-10 05:38:55,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:38:55,850 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:38:56,022 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:38:56,029 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:38:56,055 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:38:56,077 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:38:56,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56 WrapperNode [2018-11-10 05:38:56,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:38:56,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:38:56,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:38:56,078 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:38:56,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2018-11-10 05:38:56,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2018-11-10 05:38:56,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:38:56,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:38:56,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:38:56,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:38:56,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2018-11-10 05:38:56,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2018-11-10 05:38:56,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2018-11-10 05:38:56,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2018-11-10 05:38:56,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2018-11-10 05:38:56,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2018-11-10 05:38:56,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2018-11-10 05:38:56,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:38:56,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:38:56,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:38:56,165 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:38:56,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c09c2c5a-7e36-4dcb-8a0a-1832b19065bc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:38:56,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 05:38:56,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 05:38:56,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:38:56,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:38:56,390 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:38:56,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:38:56 BoogieIcfgContainer [2018-11-10 05:38:56,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:38:56,391 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:38:56,391 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:38:56,394 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:38:56,395 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:38:56,395 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:38:55" (1/3) ... [2018-11-10 05:38:56,396 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@228901fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:38:56, skipping insertion in model container [2018-11-10 05:38:56,396 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:38:56,396 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (2/3) ... [2018-11-10 05:38:56,396 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@228901fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:38:56, skipping insertion in model container [2018-11-10 05:38:56,396 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:38:56,396 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:38:56" (3/3) ... [2018-11-10 05:38:56,398 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.03-alloca_true-termination_true-no-overflow.c.i [2018-11-10 05:38:56,433 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:38:56,434 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:38:56,434 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:38:56,434 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:38:56,434 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:38:56,434 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:38:56,434 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:38:56,434 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:38:56,434 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:38:56,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-10 05:38:56,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 05:38:56,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:38:56,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:38:56,465 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:38:56,465 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:38:56,465 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:38:56,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-10 05:38:56,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 05:38:56,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:38:56,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:38:56,468 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:38:56,468 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:38:56,473 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 25#L553true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 29#L553-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 22#L554true SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 7#L555true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 23#L558-4true [2018-11-10 05:38:56,473 INFO L795 eck$LassoCheckResult]: Loop: 23#L558-4true assume true; 4#L557true SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6#L557-1true SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 8#L557-2true test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 9#L557-3true assume !test_fun_#t~short9; 31#L557-7true assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 18#L558true SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 19#L558-1true SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 21#L558-2true assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 12#L561true SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561 14#L561-1true SUMMARY for call write~int(test_fun_#t~mem13 + 1, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561-1 16#L561-2true havoc test_fun_#t~mem13; 23#L558-4true [2018-11-10 05:38:56,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:38:56,477 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 1 times [2018-11-10 05:38:56,479 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:38:56,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:38:56,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:38:56,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:38:56,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:38:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:56,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:38:56,594 INFO L82 PathProgramCache]: Analyzing trace with hash 81222733, now seen corresponding path program 1 times [2018-11-10 05:38:56,594 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:38:56,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:38:56,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:38:56,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:38:56,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:38:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:38:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:38:56,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:38:56,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:38:56,631 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:38:56,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:38:56,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:38:56,642 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-11-10 05:38:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:38:56,661 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-10 05:38:56,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:38:56,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions. [2018-11-10 05:38:56,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 05:38:56,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 23 states and 24 transitions. [2018-11-10 05:38:56,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 05:38:56,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 05:38:56,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2018-11-10 05:38:56,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:38:56,677 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-10 05:38:56,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2018-11-10 05:38:56,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 05:38:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 05:38:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-10 05:38:56,699 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-10 05:38:56,699 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-10 05:38:56,699 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:38:56,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2018-11-10 05:38:56,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 05:38:56,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:38:56,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:38:56,701 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:38:56,701 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:38:56,701 INFO L793 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 83#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 84#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 85#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 81#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 79#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 72#L558-4 [2018-11-10 05:38:56,701 INFO L795 eck$LassoCheckResult]: Loop: 72#L558-4 assume true; 73#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 74#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 76#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 80#L557-3 assume test_fun_#t~short9; 82#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 86#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 88#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 70#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 71#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 75#L558-2 assume test_fun_#t~mem10 < test_fun_#t~mem11;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 77#L559 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 68#L559-1 SUMMARY for call write~int(test_fun_#t~mem12 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559-1 69#L559-2 havoc test_fun_#t~mem12; 72#L558-4 [2018-11-10 05:38:56,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:38:56,702 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 2 times [2018-11-10 05:38:56,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:38:56,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:38:56,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:38:56,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:38:56,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:38:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:56,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:38:56,741 INFO L82 PathProgramCache]: Analyzing trace with hash 72290672, now seen corresponding path program 1 times [2018-11-10 05:38:56,741 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:38:56,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:38:56,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:38:56,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:38:56,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:38:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:56,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:38:56,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1706840436, now seen corresponding path program 1 times [2018-11-10 05:38:56,763 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:38:56,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:38:56,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:38:56,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:38:56,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:38:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:56,981 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-10 05:38:57,350 WARN L179 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 118 [2018-11-10 05:38:57,500 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-10 05:38:57,509 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:38:57,509 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:38:57,509 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:38:57,510 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:38:57,510 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:38:57,510 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:38:57,510 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:38:57,510 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:38:57,510 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.03-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-10 05:38:57,510 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:38:57,511 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:38:57,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:57,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:57,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:58,080 WARN L179 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2018-11-10 05:38:58,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:58,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:58,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:58,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:58,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:58,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:58,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:58,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:58,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:58,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:58,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:58,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:58,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:58,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:58,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:38:58,722 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:38:58,727 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:38:58,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:38:58,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:38:58,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:38:58,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:38:58,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:38:58,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:38:58,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:38:58,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:38:58,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:38:58,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-11-10 05:38:58,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:38:58,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:38:58,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:38:58,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:38:58,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:38:58,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:38:58,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:38:58,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:38:58,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-11-10 05:38:58,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:38:58,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:38:58,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:38:58,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:38:58,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:38:58,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:38:58,746 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:38:58,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:38:58,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:38:58,747 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:38:58,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:38:58,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:38:58,750 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:38:58,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:38:58,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:38:58,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:38:58,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:38:58,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:38:58,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:38:58,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:38:58,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:38:58,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:38:58,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:38:58,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:38:58,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:38:58,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:38:58,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:38:58,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:38:58,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:38:58,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:38:58,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:38:58,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:38:58,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:38:58,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:38:58,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:38:58,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:38:58,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:38:58,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:38:58,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:38:58,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:38:58,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:38:58,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:38:58,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:38:58,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:38:58,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:38:58,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:38:58,829 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:38:58,843 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:38:58,844 INFO L444 ModelExtractionUtils]: 37 out of 40 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 05:38:58,846 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:38:58,847 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:38:58,847 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:38:58,847 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 4294967291 Supporting invariants [] [2018-11-10 05:38:58,975 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-10 05:38:58,980 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:38:58,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:38:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:38:59,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:38:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:38:59,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:38:59,238 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:38:59,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 64 [2018-11-10 05:38:59,263 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:38:59,265 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:38:59,267 INFO L477 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 50 treesize of output 57 [2018-11-10 05:38:59,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:38:59,309 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:38:59,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-11-10 05:38:59,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:38:59,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 05:38:59,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-11-10 05:38:59,394 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:126 [2018-11-10 05:38:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:38:59,445 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-11-10 05:38:59,446 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 24 transitions. cyclomatic complexity: 2 Second operand 11 states. [2018-11-10 05:38:59,659 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 24 transitions. cyclomatic complexity: 2. Second operand 11 states. Result 56 states and 59 transitions. Complement of second has 19 states. [2018-11-10 05:38:59,665 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-11-10 05:38:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 05:38:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2018-11-10 05:38:59,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 6 letters. Loop has 14 letters. [2018-11-10 05:38:59,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:38:59,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 20 letters. Loop has 14 letters. [2018-11-10 05:38:59,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:38:59,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 6 letters. Loop has 28 letters. [2018-11-10 05:38:59,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:38:59,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 59 transitions. [2018-11-10 05:38:59,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 05:38:59,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 52 states and 55 transitions. [2018-11-10 05:38:59,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-10 05:38:59,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-10 05:38:59,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 55 transitions. [2018-11-10 05:38:59,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:38:59,674 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-10 05:38:59,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 55 transitions. [2018-11-10 05:38:59,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-10 05:38:59,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 05:38:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-10 05:38:59,677 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-10 05:38:59,678 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-10 05:38:59,678 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:38:59,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 52 transitions. [2018-11-10 05:38:59,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 05:38:59,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:38:59,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:38:59,680 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:38:59,680 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:38:59,680 INFO L793 eck$LassoCheckResult]: Stem: 443#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 439#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 442#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 437#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 432#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 433#L558-4 assume true; 419#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 420#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 425#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 434#L557-3 assume test_fun_#t~short9; 435#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 440#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 444#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 408#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 409#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 423#L558-2 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 427#L561 [2018-11-10 05:38:59,680 INFO L795 eck$LassoCheckResult]: Loop: 427#L561 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561 446#L561-1 SUMMARY for call write~int(test_fun_#t~mem13 + 1, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561-1 447#L561-2 havoc test_fun_#t~mem13; 416#L558-4 assume true; 456#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 455#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 429#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 430#L557-3 assume test_fun_#t~short9; 454#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 453#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 452#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 451#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 450#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 449#L558-2 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 427#L561 [2018-11-10 05:38:59,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:38:59,680 INFO L82 PathProgramCache]: Analyzing trace with hash 280756211, now seen corresponding path program 1 times [2018-11-10 05:38:59,681 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:38:59,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:38:59,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:38:59,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:38:59,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:38:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:59,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:38:59,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2017253262, now seen corresponding path program 1 times [2018-11-10 05:38:59,710 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:38:59,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:38:59,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:38:59,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:38:59,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:38:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:59,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:38:59,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1249945372, now seen corresponding path program 1 times [2018-11-10 05:38:59,723 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:38:59,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:38:59,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:38:59,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:38:59,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:38:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:59,877 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2018-11-10 05:39:00,341 WARN L179 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 141 [2018-11-10 05:39:00,536 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-11-10 05:39:00,539 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:39:00,539 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:39:00,539 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:39:00,539 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:39:00,539 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:39:00,539 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:39:00,539 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:39:00,539 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:39:00,539 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.03-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-10 05:39:00,539 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:39:00,539 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:39:00,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,002 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 132 [2018-11-10 05:39:01,159 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2018-11-10 05:39:01,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:01,716 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:39:01,716 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:39:01,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:01,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:01,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:01,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:01,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:01,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:01,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:01,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:01,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:01,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:01,721 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:39:01,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:01,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:01,722 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:39:01,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:01,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:01,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:01,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:01,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:01,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:01,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:01,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:01,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:01,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:01,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:01,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:01,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:01,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:01,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:01,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:01,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:01,751 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:01,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-11-10 05:39:01,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:01,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:01,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:01,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:01,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:01,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:01,755 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:01,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-11-10 05:39:01,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:01,756 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:39:01,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:01,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:01,757 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:39:01,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:01,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:01,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:01,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:01,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:01,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:01,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:01,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:01,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:01,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:01,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:01,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:01,767 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:39:01,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:01,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:01,768 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:39:01,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:01,772 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:01,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:01,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:01,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:01,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:01,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:01,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:01,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:01,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:01,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:01,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:01,776 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:39:01,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:01,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:01,777 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:39:01,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:01,779 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:01,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:01,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:01,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:01,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:01,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:01,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:01,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:01,785 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:01,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:01,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:01,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:01,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:01,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:01,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:01,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:01,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:01,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:01,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:01,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:01,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:01,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:01,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:01,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:01,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:01,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-11-10 05:39:01,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:01,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:01,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:01,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:01,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:01,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:01,815 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:39:01,832 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 05:39:01,832 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 05:39:01,832 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:39:01,833 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:39:01,833 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:39:01,833 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 4294967291 Supporting invariants [] [2018-11-10 05:39:02,002 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-10 05:39:02,003 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:39:02,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:39:02,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:39:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:39:02,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:39:02,059 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:39:02,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-10 05:39:02,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-10 05:39:02,064 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:39:02,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:39:02,079 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-11-10 05:39:02,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-11-10 05:39:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:39:02,184 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 05:39:02,184 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 52 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-10 05:39:02,316 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 52 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 82 states and 87 transitions. Complement of second has 13 states. [2018-11-10 05:39:02,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 05:39:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 05:39:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-11-10 05:39:02,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 17 letters. Loop has 14 letters. [2018-11-10 05:39:02,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:39:02,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 31 letters. Loop has 14 letters. [2018-11-10 05:39:02,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:39:02,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 17 letters. Loop has 28 letters. [2018-11-10 05:39:02,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:39:02,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 87 transitions. [2018-11-10 05:39:02,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 05:39:02,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 68 states and 72 transitions. [2018-11-10 05:39:02,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-10 05:39:02,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 05:39:02,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 72 transitions. [2018-11-10 05:39:02,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:39:02,323 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-10 05:39:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 72 transitions. [2018-11-10 05:39:02,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-10 05:39:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-10 05:39:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-10 05:39:02,330 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-10 05:39:02,330 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-10 05:39:02,330 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:39:02,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 70 transitions. [2018-11-10 05:39:02,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 05:39:02,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:39:02,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:39:02,332 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:39:02,332 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:39:02,332 INFO L793 eck$LassoCheckResult]: Stem: 868#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 863#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 864#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 867#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 862#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 858#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 859#L558-4 assume true; 845#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 846#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 852#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 856#L557-3 assume test_fun_#t~short9; 860#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 865#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 869#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 838#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 839#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 899#L558-2 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 871#L561 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561 872#L561-1 SUMMARY for call write~int(test_fun_#t~mem13 + 1, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561-1 876#L561-2 havoc test_fun_#t~mem13; 877#L558-4 assume true; 896#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 894#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 892#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 890#L557-3 assume test_fun_#t~short9; 888#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 886#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 884#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 882#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 849#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 850#L558-2 assume test_fun_#t~mem10 < test_fun_#t~mem11;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 854#L559 [2018-11-10 05:39:02,333 INFO L795 eck$LassoCheckResult]: Loop: 854#L559 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 834#L559-1 SUMMARY for call write~int(test_fun_#t~mem12 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559-1 835#L559-2 havoc test_fun_#t~mem12; 842#L558-4 assume true; 898#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 897#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 895#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 893#L557-3 assume test_fun_#t~short9; 891#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 889#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 887#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 885#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 883#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 881#L558-2 assume test_fun_#t~mem10 < test_fun_#t~mem11;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 854#L559 [2018-11-10 05:39:02,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:02,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1249945377, now seen corresponding path program 1 times [2018-11-10 05:39:02,333 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:39:02,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:39:02,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:02,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:39:02,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:02,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:02,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1332141298, now seen corresponding path program 2 times [2018-11-10 05:39:02,368 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:39:02,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:39:02,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:02,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:39:02,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:02,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:02,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1400002896, now seen corresponding path program 1 times [2018-11-10 05:39:02,379 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:39:02,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:39:02,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:02,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:39:02,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:39:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:39:02,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:39:02,862 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c09c2c5a-7e36-4dcb-8a0a-1832b19065bc/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:39:02,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:39:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:39:02,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:39:02,915 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:39:02,916 INFO L477 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 17 treesize of output 29 [2018-11-10 05:39:02,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:39:02,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:39:02,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 05:39:02,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:39:02,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:39:02,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:39:02,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2018-11-10 05:39:03,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-11-10 05:39:03,027 INFO L477 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 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-10 05:39:03,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:39:03,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:39:03,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:39:03,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2018-11-10 05:39:03,098 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:39:03,100 INFO L477 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 34 treesize of output 39 [2018-11-10 05:39:03,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-11-10 05:39:03,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:39:03,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:39:03,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:39:03,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:16 [2018-11-10 05:39:03,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-10 05:39:03,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-10 05:39:03,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:39:03,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-10 05:39:03,162 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:39:03,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:39:03,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:39:03,166 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:30, output treesize:3 [2018-11-10 05:39:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:39:03,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:39:03,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 25 [2018-11-10 05:39:03,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 05:39:03,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2018-11-10 05:39:03,295 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. cyclomatic complexity: 7 Second operand 26 states. [2018-11-10 05:39:03,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:39:03,797 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-10 05:39:03,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 05:39:03,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 81 transitions. [2018-11-10 05:39:03,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 05:39:03,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 81 transitions. [2018-11-10 05:39:03,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-10 05:39:03,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-11-10 05:39:03,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 81 transitions. [2018-11-10 05:39:03,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:39:03,801 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-10 05:39:03,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 81 transitions. [2018-11-10 05:39:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-10 05:39:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 05:39:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-10 05:39:03,803 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-10 05:39:03,803 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-10 05:39:03,803 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:39:03,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 81 transitions. [2018-11-10 05:39:03,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 05:39:03,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:39:03,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:39:03,805 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:39:03,805 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:39:03,805 INFO L793 eck$LassoCheckResult]: Stem: 1198#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 1194#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 1197#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 1192#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 1188#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 1189#L558-4 assume true; 1240#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1239#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1238#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 1236#L557-3 assume test_fun_#t~short9; 1234#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 1232#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 1230#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 1228#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 1226#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 1183#L558-2 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 1184#L561 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561 1201#L561-1 SUMMARY for call write~int(test_fun_#t~mem13 + 1, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561-1 1205#L561-2 havoc test_fun_#t~mem13; 1207#L558-4 assume true; 1222#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1221#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1220#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 1219#L557-3 assume test_fun_#t~short9; 1218#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 1217#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 1216#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 1214#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 1215#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 1209#L558-2 assume test_fun_#t~mem10 < test_fun_#t~mem11;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 1208#L559 [2018-11-10 05:39:03,805 INFO L795 eck$LassoCheckResult]: Loop: 1208#L559 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 1168#L559-1 SUMMARY for call write~int(test_fun_#t~mem12 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559-1 1169#L559-2 havoc test_fun_#t~mem12; 1178#L558-4 assume true; 1172#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1173#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1181#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 1186#L557-3 assume test_fun_#t~short9; 1190#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 1195#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 1199#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 1164#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 1165#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 1176#L558-2 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 1211#L561 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561 1203#L561-1 SUMMARY for call write~int(test_fun_#t~mem13 + 1, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561-1 1204#L561-2 havoc test_fun_#t~mem13; 1206#L558-4 assume true; 1237#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1235#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1233#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 1231#L557-3 assume test_fun_#t~short9; 1229#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 1227#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 1225#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 1224#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 1223#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 1213#L558-2 assume test_fun_#t~mem10 < test_fun_#t~mem11;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 1208#L559 [2018-11-10 05:39:03,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:03,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1249945377, now seen corresponding path program 2 times [2018-11-10 05:39:03,806 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:39:03,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:39:03,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:03,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:39:03,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:03,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:03,833 INFO L82 PathProgramCache]: Analyzing trace with hash -724492573, now seen corresponding path program 1 times [2018-11-10 05:39:03,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:39:03,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:39:03,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:03,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:39:03,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:03,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:03,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1348165951, now seen corresponding path program 2 times [2018-11-10 05:39:03,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:39:03,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:39:03,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:03,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:39:03,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:04,127 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2018-11-10 05:39:04,775 WARN L179 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 164 [2018-11-10 05:39:04,989 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-11-10 05:39:04,992 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:39:04,992 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:39:04,992 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:39:04,992 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:39:04,992 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:39:04,993 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:39:04,993 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:39:04,993 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:39:04,993 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.03-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-10 05:39:04,993 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:39:04,993 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:39:04,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:04,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:05,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:05,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:05,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:05,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:05,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:05,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:05,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:05,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:05,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:05,502 WARN L179 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 133 [2018-11-10 05:39:05,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:05,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:05,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-11-10 05:39:05,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:05,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-11-10 05:39:05,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-11-10 05:39:05,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-11-10 05:39:06,111 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:39:06,111 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:39:06,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:39:06,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:06,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:39:06,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:39:06,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:06,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:39:06,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:06,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:39:06,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:39:06,113 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:06,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:06,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:06,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:06,115 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:06,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:39:06,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:06,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:39:06,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:39:06,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:06,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:39:06,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:06,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:39:06,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:39:06,117 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:06,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:39:06,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:06,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:39:06,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:39:06,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:06,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:06,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:06,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:06,120 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:06,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:39:06,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:06,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:39:06,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:39:06,122 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:06,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:39:06,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:06,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:39:06,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:39:06,123 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:06,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:06,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:06,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:06,125 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:06,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,126 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:39:06,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,127 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:39:06,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:06,129 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:06,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:06,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:06,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:06,131 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:06,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,132 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:39:06,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,133 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:39:06,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:06,135 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:06,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:06,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:06,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:06,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:06,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:06,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:06,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:06,141 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:06,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:06,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:06,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:06,144 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:06,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:06,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:06,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:06,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:06,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:06,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:06,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:06,161 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:39:06,172 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 05:39:06,172 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 05:39:06,173 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:39:06,174 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:39:06,174 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:39:06,174 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 + 4294967289 Supporting invariants [] [2018-11-10 05:39:06,307 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-10 05:39:06,308 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:39:06,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:39:06,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:39:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:39:06,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:39:06,363 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:39:06,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-10 05:39:06,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-10 05:39:06,370 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:39:06,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:39:06,379 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-11-10 05:39:06,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-11-10 05:39:06,405 INFO L477 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 23 treesize of output 35 [2018-11-10 05:39:06,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-10 05:39:06,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:39:06,444 INFO L477 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 21 treesize of output 29 [2018-11-10 05:39:06,445 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 05:39:06,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:39:06,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 05:39:06,469 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:32 [2018-11-10 05:39:06,864 WARN L179 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-10 05:39:07,320 WARN L179 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-10 05:39:09,464 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-11-10 05:39:09,844 WARN L179 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-10 05:39:10,270 WARN L179 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-10 05:39:10,876 WARN L179 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-10 05:39:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:39:10,876 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-11-10 05:39:10,876 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 81 transitions. cyclomatic complexity: 7 Second operand 10 states. [2018-11-10 05:39:11,497 WARN L179 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 27 [2018-11-10 05:39:11,833 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 31 [2018-11-10 05:39:14,487 WARN L179 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2018-11-10 05:39:15,849 WARN L179 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-11-10 05:39:15,858 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 81 transitions. cyclomatic complexity: 7. Second operand 10 states. Result 189 states and 197 transitions. Complement of second has 28 states. [2018-11-10 05:39:15,858 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-11-10 05:39:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 05:39:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 53 transitions. [2018-11-10 05:39:15,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 53 transitions. Stem has 31 letters. Loop has 28 letters. [2018-11-10 05:39:15,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:39:15,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 53 transitions. Stem has 59 letters. Loop has 28 letters. [2018-11-10 05:39:15,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:39:15,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 53 transitions. Stem has 31 letters. Loop has 56 letters. [2018-11-10 05:39:15,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:39:15,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 197 transitions. [2018-11-10 05:39:15,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:39:15,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 147 states and 154 transitions. [2018-11-10 05:39:15,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 05:39:15,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2018-11-10 05:39:15,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 154 transitions. [2018-11-10 05:39:15,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:39:15,863 INFO L705 BuchiCegarLoop]: Abstraction has 147 states and 154 transitions. [2018-11-10 05:39:15,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 154 transitions. [2018-11-10 05:39:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 118. [2018-11-10 05:39:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-10 05:39:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-11-10 05:39:15,868 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-11-10 05:39:15,868 INFO L608 BuchiCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-11-10 05:39:15,868 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 05:39:15,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 125 transitions. [2018-11-10 05:39:15,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:39:15,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:39:15,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:39:15,870 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:39:15,870 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:39:15,870 INFO L793 eck$LassoCheckResult]: Stem: 1864#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1858#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 1859#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 1863#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 1857#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 1849#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 1850#L558-4 assume true; 1906#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1905#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1904#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 1903#L557-3 assume test_fun_#t~short9; 1902#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 1901#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 1900#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 1899#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 1898#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 1896#L558-2 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 1894#L561 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561 1893#L561-1 SUMMARY for call write~int(test_fun_#t~mem13 + 1, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561-1 1892#L561-2 havoc test_fun_#t~mem13; 1891#L558-4 assume true; 1890#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1889#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1888#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 1887#L557-3 assume test_fun_#t~short9; 1886#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 1885#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 1884#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 1882#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 1880#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 1878#L558-2 assume test_fun_#t~mem10 < test_fun_#t~mem11;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 1874#L559 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 1829#L559-1 SUMMARY for call write~int(test_fun_#t~mem12 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559-1 1830#L559-2 havoc test_fun_#t~mem12; 1839#L558-4 [2018-11-10 05:39:15,870 INFO L795 eck$LassoCheckResult]: Loop: 1839#L558-4 assume true; 1833#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1834#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1842#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 1846#L557-3 assume test_fun_#t~short9; 1854#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 1860#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 1865#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 1825#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 1826#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 1837#L558-2 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 1844#L561 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561 1868#L561-1 SUMMARY for call write~int(test_fun_#t~mem13 + 1, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561-1 1872#L561-2 havoc test_fun_#t~mem13; 1839#L558-4 [2018-11-10 05:39:15,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:15,871 INFO L82 PathProgramCache]: Analyzing trace with hash 243762915, now seen corresponding path program 3 times [2018-11-10 05:39:15,871 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:39:15,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:39:15,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:15,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:39:15,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:15,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:15,905 INFO L82 PathProgramCache]: Analyzing trace with hash 72444592, now seen corresponding path program 2 times [2018-11-10 05:39:15,905 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:39:15,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:39:15,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:15,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:39:15,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:15,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:15,915 INFO L82 PathProgramCache]: Analyzing trace with hash -940949998, now seen corresponding path program 4 times [2018-11-10 05:39:15,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:39:15,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:39:15,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:15,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:39:15,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:16,060 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2018-11-10 05:39:17,331 WARN L179 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 217 DAG size of output: 180 [2018-11-10 05:39:17,817 WARN L179 SmtUtils]: Spent 482.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-11-10 05:39:17,820 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:39:17,820 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:39:17,820 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:39:17,820 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:39:17,820 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:39:17,820 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:39:17,820 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:39:17,820 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:39:17,820 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.03-alloca_true-termination_true-no-overflow.c.i_Iteration6_Lasso [2018-11-10 05:39:17,820 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:39:17,820 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:39:17,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:17,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:17,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:18,473 WARN L179 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 137 [2018-11-10 05:39:18,602 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2018-11-10 05:39:18,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:18,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:18,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-11-10 05:39:18,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-11-10 05:39:18,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-11-10 05:39:18,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:18,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:18,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:18,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:18,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:18,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:18,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:18,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:18,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:18,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:18,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:18,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:18,914 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-11-10 05:39:19,177 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:39:19,177 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:39:19,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:19,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:19,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:39:19,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:19,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:19,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:19,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:39:19,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:39:19,179 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:19,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:19,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:19,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:19,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:19,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:19,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:19,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:19,181 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:19,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:19,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:19,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:19,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:19,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:19,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:19,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:19,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:19,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:19,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:19,189 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:39:19,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:19,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:19,189 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:39:19,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:19,192 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:19,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:19,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:19,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:19,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:19,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:19,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:19,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:19,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:19,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:19,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:19,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:19,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:19,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:19,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:19,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:19,209 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:39:19,223 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 05:39:19,224 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 05:39:19,224 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:39:19,224 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:39:19,226 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:39:19,226 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_4 + 4294967293 Supporting invariants [] [2018-11-10 05:39:19,363 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-10 05:39:19,364 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:39:19,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:39:19,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:39:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:39:19,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:39:19,436 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:39:19,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-10 05:39:19,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-10 05:39:19,441 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:39:19,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:39:19,455 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-11-10 05:39:19,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-11-10 05:39:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:39:19,469 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 05:39:19,469 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 125 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-10 05:39:19,550 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 125 transitions. cyclomatic complexity: 12. Second operand 8 states. Result 294 states and 308 transitions. Complement of second has 13 states. [2018-11-10 05:39:19,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 05:39:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:39:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2018-11-10 05:39:19,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 34 letters. Loop has 14 letters. [2018-11-10 05:39:19,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:39:19,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 48 letters. Loop has 14 letters. [2018-11-10 05:39:19,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:39:19,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 34 letters. Loop has 28 letters. [2018-11-10 05:39:19,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:39:19,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 308 transitions. [2018-11-10 05:39:19,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:39:19,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 219 states and 229 transitions. [2018-11-10 05:39:19,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-10 05:39:19,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 05:39:19,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 229 transitions. [2018-11-10 05:39:19,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:39:19,556 INFO L705 BuchiCegarLoop]: Abstraction has 219 states and 229 transitions. [2018-11-10 05:39:19,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 229 transitions. [2018-11-10 05:39:19,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 157. [2018-11-10 05:39:19,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 05:39:19,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 165 transitions. [2018-11-10 05:39:19,563 INFO L728 BuchiCegarLoop]: Abstraction has 157 states and 165 transitions. [2018-11-10 05:39:19,563 INFO L608 BuchiCegarLoop]: Abstraction has 157 states and 165 transitions. [2018-11-10 05:39:19,563 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 05:39:19,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 165 transitions. [2018-11-10 05:39:19,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:39:19,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:39:19,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:39:19,568 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:39:19,568 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:39:19,568 INFO L793 eck$LassoCheckResult]: Stem: 2620#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2614#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 2615#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 2619#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 2613#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 2607#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 2608#L558-4 assume true; 2646#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 2739#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 2738#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 2737#L557-3 assume test_fun_#t~short9; 2736#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 2735#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 2734#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 2733#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 2732#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 2731#L558-2 assume test_fun_#t~mem10 < test_fun_#t~mem11;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 2730#L559 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 2585#L559-1 SUMMARY for call write~int(test_fun_#t~mem12 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559-1 2586#L559-2 havoc test_fun_#t~mem12; 2609#L558-4 assume true; 2593#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 2594#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 2602#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 2606#L557-3 assume test_fun_#t~short9; 2612#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 2618#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 2623#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 2589#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 2590#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 2596#L558-2 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 2604#L561 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561 2625#L561-1 SUMMARY for call write~int(test_fun_#t~mem13 + 1, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561-1 2629#L561-2 havoc test_fun_#t~mem13; 2634#L558-4 assume true; 2707#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 2706#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 2705#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 2704#L557-3 assume test_fun_#t~short9; 2703#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 2702#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 2701#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 2675#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 2674#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 2663#L558-2 assume test_fun_#t~mem10 < test_fun_#t~mem11;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 2660#L559 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 2583#L559-1 SUMMARY for call write~int(test_fun_#t~mem12 + 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559-1 2584#L559-2 havoc test_fun_#t~mem12; 2597#L558-4 [2018-11-10 05:39:19,568 INFO L795 eck$LassoCheckResult]: Loop: 2597#L558-4 assume true; 2591#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 2592#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 2659#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 2610#L557-3 assume test_fun_#t~short9; 2611#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-4 2621#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 2622#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7; 2642#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 2639#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 2637#L558-2 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10; 2635#L561 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561 2627#L561-1 SUMMARY for call write~int(test_fun_#t~mem13 + 1, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561-1 2628#L561-2 havoc test_fun_#t~mem13; 2597#L558-4 [2018-11-10 05:39:19,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:19,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2009666770, now seen corresponding path program 5 times [2018-11-10 05:39:19,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:39:19,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:39:19,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:19,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:39:19,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:19,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:19,599 INFO L82 PathProgramCache]: Analyzing trace with hash 72444592, now seen corresponding path program 3 times [2018-11-10 05:39:19,599 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:39:19,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:39:19,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:19,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:39:19,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:19,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:19,606 INFO L82 PathProgramCache]: Analyzing trace with hash 684277185, now seen corresponding path program 6 times [2018-11-10 05:39:19,606 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:39:19,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:39:19,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:19,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:39:19,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:39:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:39:19,754 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2018-11-10 05:39:21,848 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 255 DAG size of output: 205 [2018-11-10 05:39:22,599 WARN L179 SmtUtils]: Spent 742.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-10 05:39:22,602 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:39:22,602 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:39:22,602 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:39:22,602 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:39:22,602 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:39:22,602 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:39:22,602 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:39:22,602 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:39:22,602 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.03-alloca_true-termination_true-no-overflow.c.i_Iteration7_Lasso [2018-11-10 05:39:22,602 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:39:22,602 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:39:22,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-11-10 05:39:22,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-11-10 05:39:22,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:22,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:22,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:22,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:22,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:22,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:22,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:22,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:22,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:23,268 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 136 [2018-11-10 05:39:23,381 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2018-11-10 05:39:23,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:23,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:23,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:23,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:23,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:23,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:23,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:23,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:39:23,614 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-11-10 05:39:23,946 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:39:23,946 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:39:23,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:23,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:23,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:23,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:23,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:23,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:23,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:23,957 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:23,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:23,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:23,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:39:23,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:23,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:23,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:23,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:39:23,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:39:23,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:23,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:23,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:23,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:23,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:23,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:23,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:23,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:23,962 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:23,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:23,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:23,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:23,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:23,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:23,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:23,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:23,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:23,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:23,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:23,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:39:23,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:23,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:23,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:23,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:39:23,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:39:23,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:23,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:39:23,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:23,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:39:23,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:23,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:23,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:23,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:39:23,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:39:23,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:23,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-11-10 05:39:23,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:23,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:39:23,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:23,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:23,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:23,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:39:23,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:39:23,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:23,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-11-10 05:39:23,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:23,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:39:23,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:23,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:23,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:23,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:39:23,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:39:23,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:23,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-11-10 05:39:23,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:23,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:39:23,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:23,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:23,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:23,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:39:23,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:39:23,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:23,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-11-10 05:39:23,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:23,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:39:23,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:23,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:23,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:23,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:39:23,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:39:23,977 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:39:23,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-11-10 05:39:23,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:39:23,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:39:23,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:39:23,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:39:23,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:39:23,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:39:23,992 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:39:24,007 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 05:39:24,007 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 05:39:24,007 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:39:24,008 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:39:24,008 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:39:24,008 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_5) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_5 + 4294967293 Supporting invariants [] [2018-11-10 05:39:24,206 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-10 05:39:24,208 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:39:24,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:39:24,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:39:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:39:24,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:39:24,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:39:24,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-10 05:39:24,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-10 05:39:24,322 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:39:24,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:39:24,335 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-11-10 05:39:24,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-11-10 05:39:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:39:24,347 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 05:39:24,347 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 165 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-11-10 05:39:24,401 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 165 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 246 states and 259 transitions. Complement of second has 13 states. [2018-11-10 05:39:24,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 05:39:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:39:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2018-11-10 05:39:24,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 48 letters. Loop has 14 letters. [2018-11-10 05:39:24,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:39:24,402 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:39:24,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:39:24,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:39:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:39:24,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:39:24,466 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:39:24,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-10 05:39:24,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-10 05:39:24,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:39:24,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:39:24,478 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-11-10 05:39:24,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-11-10 05:39:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:39:24,487 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 05:39:24,488 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 165 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-11-10 05:39:24,558 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 165 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 243 states and 255 transitions. Complement of second has 15 states. [2018-11-10 05:39:24,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 05:39:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:39:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2018-11-10 05:39:24,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 48 letters. Loop has 14 letters. [2018-11-10 05:39:24,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:39:24,559 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:39:24,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:39:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:39:24,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:39:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:39:24,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:39:24,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:39:24,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-10 05:39:24,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-10 05:39:24,673 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:39:24,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:39:24,686 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-11-10 05:39:24,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-11-10 05:39:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:39:24,698 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 6 loop predicates [2018-11-10 05:39:24,698 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 165 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-11-10 05:39:24,761 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 165 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 287 states and 304 transitions. Complement of second has 12 states. [2018-11-10 05:39:24,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 05:39:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:39:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2018-11-10 05:39:24,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 42 transitions. Stem has 48 letters. Loop has 14 letters. [2018-11-10 05:39:24,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:39:24,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 42 transitions. Stem has 62 letters. Loop has 14 letters. [2018-11-10 05:39:24,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:39:24,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 42 transitions. Stem has 48 letters. Loop has 28 letters. [2018-11-10 05:39:24,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:39:24,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 287 states and 304 transitions. [2018-11-10 05:39:24,768 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:39:24,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 287 states to 0 states and 0 transitions. [2018-11-10 05:39:24,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:39:24,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:39:24,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:39:24,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:39:24,769 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:39:24,769 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:39:24,769 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:39:24,769 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 05:39:24,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:39:24,769 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:39:24,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:39:24,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:39:24 BoogieIcfgContainer [2018-11-10 05:39:24,775 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:39:24,775 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:39:24,775 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:39:24,775 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:39:24,776 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:38:56" (3/4) ... [2018-11-10 05:39:24,779 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:39:24,779 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:39:24,779 INFO L168 Benchmark]: Toolchain (without parser) took 28966.03 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 510.1 MB). Free memory was 957.5 MB in the beginning and 1.5 GB in the end (delta: -523.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:39:24,780 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:39:24,780 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.51 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:39:24,780 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:39:24,781 INFO L168 Benchmark]: Boogie Preprocessor took 16.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:39:24,781 INFO L168 Benchmark]: RCFGBuilder took 226.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:39:24,781 INFO L168 Benchmark]: BuchiAutomizer took 28383.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 375.4 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -380.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:39:24,781 INFO L168 Benchmark]: Witness Printer took 3.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:39:24,783 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.51 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 226.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 28383.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 375.4 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -380.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 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 7 terminating modules (2 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x_ref][x_ref] + 4294967291 and consists of 10 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 4294967291 and consists of 7 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x_ref][x_ref] + 4294967289 and consists of 15 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 4294967293 and consists of 7 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 4294967293 and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 28.3s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 16.3s. Construction of modules took 0.5s. Büchi inclusion checks took 11.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 96 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 157 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/11 HoareTripleCheckerStatistics: 229 SDtfs, 356 SDslu, 304 SDs, 0 SdLazy, 879 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital2443 mio100 ax102 hnf100 lsp96 ukn37 mio100 lsp36 div100 bol100 ite100 ukn100 eq203 hnf87 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...