./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3_true-termination.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_be0b4f8f-9c1a-4670-90ca-307b5af0508e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_be0b4f8f-9c1a-4670-90ca-307b5af0508e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_be0b4f8f-9c1a-4670-90ca-307b5af0508e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_be0b4f8f-9c1a-4670-90ca-307b5af0508e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_be0b4f8f-9c1a-4670-90ca-307b5af0508e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_be0b4f8f-9c1a-4670-90ca-307b5af0508e/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 a96be28be4b50f026536d78db5ba85eeb0ae4413 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:06:26,983 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:06:26,984 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:06:26,994 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:06:26,994 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:06:26,995 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:06:26,996 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:06:26,998 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:06:26,999 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:06:27,000 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:06:27,001 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:06:27,001 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:06:27,002 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:06:27,003 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:06:27,004 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:06:27,004 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:06:27,005 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:06:27,007 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:06:27,008 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:06:27,010 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:06:27,011 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:06:27,012 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:06:27,014 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:06:27,015 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:06:27,015 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:06:27,016 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:06:27,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:06:27,018 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:06:27,018 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:06:27,020 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:06:27,020 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:06:27,021 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:06:27,021 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:06:27,021 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:06:27,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:06:27,023 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:06:27,023 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_be0b4f8f-9c1a-4670-90ca-307b5af0508e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:06:27,036 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:06:27,036 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:06:27,037 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:06:27,038 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:06:27,038 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:06:27,038 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:06:27,038 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:06:27,038 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:06:27,038 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:06:27,039 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:06:27,039 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:06:27,039 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:06:27,039 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:06:27,039 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:06:27,039 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:06:27,039 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:06:27,040 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:06:27,040 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:06:27,040 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:06:27,040 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:06:27,040 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:06:27,040 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:06:27,040 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:06:27,042 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:06:27,043 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:06:27,043 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:06:27,043 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:06:27,044 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:06:27,044 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_be0b4f8f-9c1a-4670-90ca-307b5af0508e/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 -> a96be28be4b50f026536d78db5ba85eeb0ae4413 [2018-10-27 06:06:27,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:06:27,091 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:06:27,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:06:27,096 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:06:27,097 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:06:27,098 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_be0b4f8f-9c1a-4670-90ca-307b5af0508e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3_true-termination.c.i [2018-10-27 06:06:27,142 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_be0b4f8f-9c1a-4670-90ca-307b5af0508e/bin-2019/uautomizer/data/0354c6a2d/bd05f95257c347fcaab0992ac6da671b/FLAG6c64e6085 [2018-10-27 06:06:27,524 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:06:27,525 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_be0b4f8f-9c1a-4670-90ca-307b5af0508e/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3_true-termination.c.i [2018-10-27 06:06:27,529 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_be0b4f8f-9c1a-4670-90ca-307b5af0508e/bin-2019/uautomizer/data/0354c6a2d/bd05f95257c347fcaab0992ac6da671b/FLAG6c64e6085 [2018-10-27 06:06:27,542 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_be0b4f8f-9c1a-4670-90ca-307b5af0508e/bin-2019/uautomizer/data/0354c6a2d/bd05f95257c347fcaab0992ac6da671b [2018-10-27 06:06:27,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:06:27,547 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:06:27,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:27,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:06:27,551 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:06:27,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:27" (1/1) ... [2018-10-27 06:06:27,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60264b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:27, skipping insertion in model container [2018-10-27 06:06:27,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:27" (1/1) ... [2018-10-27 06:06:27,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:06:27,581 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:06:27,707 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:27,716 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:06:27,729 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:27,743 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:06:27,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:27 WrapperNode [2018-10-27 06:06:27,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:27,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:27,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:06:27,745 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:06:27,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:27" (1/1) ... [2018-10-27 06:06:27,762 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:27" (1/1) ... [2018-10-27 06:06:27,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:27,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:06:27,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:06:27,782 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:06:27,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:27" (1/1) ... [2018-10-27 06:06:27,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:27" (1/1) ... [2018-10-27 06:06:27,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:27" (1/1) ... [2018-10-27 06:06:27,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:27" (1/1) ... [2018-10-27 06:06:27,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:27" (1/1) ... [2018-10-27 06:06:27,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:27" (1/1) ... [2018-10-27 06:06:27,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:27" (1/1) ... [2018-10-27 06:06:27,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:06:27,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:06:27,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:06:27,803 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:06:27,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_be0b4f8f-9c1a-4670-90ca-307b5af0508e/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-10-27 06:06:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:06:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-10-27 06:06:27,936 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-10-27 06:06:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:06:27,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:06:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:06:28,307 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:06:28,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:28 BoogieIcfgContainer [2018-10-27 06:06:28,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:06:28,309 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:06:28,309 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:06:28,313 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:06:28,313 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:28,314 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:06:27" (1/3) ... [2018-10-27 06:06:28,315 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28bccdaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:28, skipping insertion in model container [2018-10-27 06:06:28,315 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:28,315 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:27" (2/3) ... [2018-10-27 06:06:28,316 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28bccdaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:28, skipping insertion in model container [2018-10-27 06:06:28,316 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:28,316 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:28" (3/3) ... [2018-10-27 06:06:28,317 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex3_true-termination.c.i [2018-10-27 06:06:28,372 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:06:28,373 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:06:28,373 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:06:28,374 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:06:28,374 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:06:28,374 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:06:28,374 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:06:28,374 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:06:28,374 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:06:28,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-10-27 06:06:28,416 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:06:28,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:28,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:28,425 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:06:28,425 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:28,425 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:06:28,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-10-27 06:06:28,428 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:06:28,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:28,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:28,429 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:06:28,430 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:28,438 INFO L793 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 7#L20-3true [2018-10-27 06:06:28,439 INFO L795 eck$LassoCheckResult]: Loop: 7#L20-3true assume true; 10#L20-1true assume !!(main_~i~0 > 0);#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];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 18#L22true SUMMARY for call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4); srcloc: L22 15#L22-1true havoc main_#t~nondet8; 22#L23true call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 5#recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset; 13#L9true SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 17#L9-1true assume #t~mem1 < 0;havoc #t~mem1; 26#L10true SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 4); srcloc: L10 14#L10-1true ~pv~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~pv~0; 23#recFINALtrue assume true; 20#recEXITtrue >#40#return; 19#L23-1true main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 7#L20-3true [2018-10-27 06:06:28,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:28,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2018-10-27 06:06:28,449 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:28,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:28,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:28,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:28,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:28,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:28,548 INFO L82 PathProgramCache]: Analyzing trace with hash 169808128, now seen corresponding path program 1 times [2018-10-27 06:06:28,548 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:28,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:28,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:28,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:28,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:28,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:28,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1298711198, now seen corresponding path program 1 times [2018-10-27 06:06:28,598 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:28,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:28,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:28,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:28,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:28,867 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 06:06:29,303 WARN L179 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-27 06:06:29,737 WARN L179 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2018-10-27 06:06:30,064 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-10-27 06:06:30,087 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:30,088 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:30,088 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:30,088 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:30,089 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:30,089 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:30,089 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:30,089 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:30,089 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration1_Lasso [2018-10-27 06:06:30,089 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:30,090 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:30,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:30,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:30,381 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-10-27 06:06:30,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-10-27 06:06:30,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-10-27 06:06:30,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-10-27 06:06:30,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-10-27 06:06:30,613 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:30,617 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:30,619 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-10-27 06:06:30,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:30,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:30,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:30,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:30,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:30,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:30,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:30,627 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:30,627 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-10-27 06:06:30,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:30,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:30,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:30,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:30,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:30,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:30,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:30,641 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:30,642 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-10-27 06:06:30,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:30,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:30,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:30,643 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:30,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:30,647 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:30,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:30,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:30,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:30,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:30,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:30,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:30,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:30,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:30,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:30,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:30,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:30,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:30,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:30,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:30,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:30,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:30,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:30,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:30,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:30,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:30,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:30,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:30,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:30,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:30,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:30,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:30,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:30,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:30,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:30,682 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-10-27 06:06:30,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:30,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:30,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:30,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:30,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:30,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:30,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:30,688 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:30,689 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-10-27 06:06:30,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:30,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:30,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:30,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:30,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:30,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:30,705 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:30,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:30,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:30,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:30,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:30,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:30,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:30,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:30,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:30,715 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:30,722 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:30,725 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:06:30,727 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:30,728 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:06:30,728 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:30,728 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:06:30,731 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:06:30,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:30,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:30,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:30,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:06:30,928 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-10-27 06:06:30,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:30,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:30,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:30,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-10-27 06:06:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:31,034 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-10-27 06:06:31,035 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 10 states. [2018-10-27 06:06:31,250 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 10 states. Result 107 states and 119 transitions. Complement of second has 30 states. [2018-10-27 06:06:31,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:06:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2018-10-27 06:06:31,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 32 transitions. Stem has 2 letters. Loop has 13 letters. [2018-10-27 06:06:31,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:31,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 32 transitions. Stem has 15 letters. Loop has 13 letters. [2018-10-27 06:06:31,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:31,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 32 transitions. Stem has 2 letters. Loop has 26 letters. [2018-10-27 06:06:31,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:31,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 119 transitions. [2018-10-27 06:06:31,272 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:06:31,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 66 states and 73 transitions. [2018-10-27 06:06:31,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-10-27 06:06:31,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-10-27 06:06:31,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 73 transitions. [2018-10-27 06:06:31,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:31,284 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-10-27 06:06:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 73 transitions. [2018-10-27 06:06:31,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2018-10-27 06:06:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-27 06:06:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-10-27 06:06:31,316 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-10-27 06:06:31,317 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-10-27 06:06:31,317 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:06:31,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 69 transitions. [2018-10-27 06:06:31,319 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:06:31,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:31,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:31,320 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:31,320 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:31,320 INFO L793 eck$LassoCheckResult]: Stem: 273#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 265#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 266#L20-3 assume true; 256#L20-1 assume !!(main_~i~0 > 0);#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];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 285#L22 SUMMARY for call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4); srcloc: L22 267#L22-1 havoc main_#t~nondet8; 268#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 284#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 283#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 270#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1; 271#L14 SUMMARY for call #t~mem3 := read~int(~p.base, ~p.offset, 4); srcloc: L14 301#L14-1 #t~post4 := #t~mem3; 298#L14-2 SUMMARY for call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4); srcloc: L14-2 296#L14-3 havoc #t~post4;havoc #t~mem3; 242#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 246#recENTRY [2018-10-27 06:06:31,321 INFO L795 eck$LassoCheckResult]: Loop: 246#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 247#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 260#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1; 240#L14 SUMMARY for call #t~mem3 := read~int(~p.base, ~p.offset, 4); srcloc: L14 243#L14-1 #t~post4 := #t~mem3; 251#L14-2 SUMMARY for call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4); srcloc: L14-2 257#L14-3 havoc #t~post4;havoc #t~mem3; 241#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 246#recENTRY [2018-10-27 06:06:31,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:31,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1387453850, now seen corresponding path program 1 times [2018-10-27 06:06:31,322 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:31,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:31,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:31,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:31,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:31,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:31,358 INFO L82 PathProgramCache]: Analyzing trace with hash -711880450, now seen corresponding path program 1 times [2018-10-27 06:06:31,358 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:31,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:31,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:31,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:31,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:31,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:31,372 INFO L82 PathProgramCache]: Analyzing trace with hash 117294487, now seen corresponding path program 2 times [2018-10-27 06:06:31,376 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:31,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:31,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:31,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:31,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:31,841 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2018-10-27 06:06:32,052 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2018-10-27 06:06:32,080 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:32,080 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:32,080 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:32,080 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:32,080 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:32,080 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:32,081 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:32,081 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:32,081 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:06:32,081 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:32,081 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:32,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,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-10-27 06:06:32,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:32,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-10-27 06:06:32,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-10-27 06:06:32,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-10-27 06:06:32,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-10-27 06:06:32,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-10-27 06:06:32,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-10-27 06:06:32,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-10-27 06:06:32,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-10-27 06:06:32,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-10-27 06:06:32,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-10-27 06:06:32,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-10-27 06:06:32,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-10-27 06:06:32,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-10-27 06:06:32,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-10-27 06:06:32,406 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:32,406 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:32,407 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-10-27 06:06:32,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:32,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:32,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:32,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:32,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:32,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:32,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:32,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:32,412 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-10-27 06:06:32,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:32,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:32,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:32,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:32,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:32,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:32,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:32,414 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:32,415 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-10-27 06:06:32,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:32,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:32,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:32,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:32,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:32,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:32,424 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:32,425 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-10-27 06:06:32,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:32,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:32,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:32,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:32,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:32,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:32,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:32,427 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:32,427 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-10-27 06:06:32,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:32,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:32,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:32,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:32,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:32,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:32,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:32,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:32,434 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-10-27 06:06:32,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:32,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:32,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:32,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:32,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:32,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:32,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:32,439 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:32,439 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-10-27 06:06:32,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:32,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:32,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:32,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:32,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:32,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:32,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:32,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:32,441 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-10-27 06:06:32,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:32,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:32,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:32,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:32,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:32,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:32,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:32,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:32,444 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-10-27 06:06:32,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:32,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:32,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:32,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:32,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:32,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:32,455 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:32,456 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-10-27 06:06:32,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:32,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:32,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:32,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:32,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:32,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:32,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:32,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:32,460 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-10-27 06:06:32,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:32,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:32,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:32,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:32,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:32,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:32,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:32,463 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:32,463 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-10-27 06:06:32,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:32,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:32,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:32,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:32,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:32,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:32,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:32,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:32,472 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-10-27 06:06:32,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:32,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:32,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:32,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:32,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:32,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:32,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:32,474 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:32,474 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-10-27 06:06:32,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:32,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:32,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:32,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:32,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:32,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:32,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:32,488 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-10-27 06:06:32,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:32,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:32,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:32,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:32,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:32,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:32,509 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:32,515 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:32,515 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:06:32,516 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:32,518 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:32,519 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:32,519 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1 + 1 Supporting invariants [] [2018-10-27 06:06:32,545 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-10-27 06:06:32,550 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:32,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:32,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:32,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:32,739 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:32,741 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-10-27 06:06:32,743 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-10-27 06:06:32,745 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:06:32,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:06:32,762 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-10-27 06:06:32,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-10-27 06:06:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:32,796 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-10-27 06:06:32,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 69 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-10-27 06:06:33,175 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 69 transitions. cyclomatic complexity: 10. Second operand 8 states. Result 117 states and 127 transitions. Complement of second has 33 states. [2018-10-27 06:06:33,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:06:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2018-10-27 06:06:33,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 15 letters. Loop has 8 letters. [2018-10-27 06:06:33,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:33,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 23 letters. Loop has 8 letters. [2018-10-27 06:06:33,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:33,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 15 letters. Loop has 16 letters. [2018-10-27 06:06:33,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:33,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 127 transitions. [2018-10-27 06:06:33,185 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:06:33,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 90 states and 100 transitions. [2018-10-27 06:06:33,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-10-27 06:06:33,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2018-10-27 06:06:33,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 100 transitions. [2018-10-27 06:06:33,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:33,190 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 100 transitions. [2018-10-27 06:06:33,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 100 transitions. [2018-10-27 06:06:33,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2018-10-27 06:06:33,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-27 06:06:33,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-10-27 06:06:33,200 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-10-27 06:06:33,200 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-10-27 06:06:33,200 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:06:33,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 95 transitions. [2018-10-27 06:06:33,203 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:06:33,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:33,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:33,205 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:33,205 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:33,205 INFO L793 eck$LassoCheckResult]: Stem: 599#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 589#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 590#L20-3 assume true; 582#L20-1 assume !!(main_~i~0 > 0);#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];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 586#L22 SUMMARY for call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4); srcloc: L22 601#L22-1 havoc main_#t~nondet8; 563#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 569#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 570#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 619#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1; 562#L14 SUMMARY for call #t~mem3 := read~int(~p.base, ~p.offset, 4); srcloc: L14 564#L14-1 #t~post4 := #t~mem3; 624#L14-2 SUMMARY for call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4); srcloc: L14-2 623#L14-3 havoc #t~post4;havoc #t~mem3; 560#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 620#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 622#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 637#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 636#L10 SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 4); srcloc: L10 593#L10-1 ~pv~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~pv~0; 561#recFINAL assume true; 608#recEXIT >#38#return; 631#L15-1 #res := #t~ret5;havoc #t~ret5; 628#recFINAL assume true; 626#recEXIT >#40#return; 602#L23-1 [2018-10-27 06:06:33,205 INFO L795 eck$LassoCheckResult]: Loop: 602#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 579#L20-3 assume true; 580#L20-1 assume !!(main_~i~0 > 0);#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];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 627#L22 SUMMARY for call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4); srcloc: L22 597#L22-1 havoc main_#t~nondet8; 576#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 588#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 625#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 616#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 617#L10 SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 4); srcloc: L10 630#L10-1 ~pv~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~pv~0; 629#recFINAL assume true; 614#recEXIT >#40#return; 602#L23-1 [2018-10-27 06:06:33,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:33,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1668433253, now seen corresponding path program 1 times [2018-10-27 06:06:33,206 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:33,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:33,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:33,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:33,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:33,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:33,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1920162748, now seen corresponding path program 2 times [2018-10-27 06:06:33,242 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:33,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:33,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:33,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:33,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:33,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:33,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1170474792, now seen corresponding path program 1 times [2018-10-27 06:06:33,273 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:33,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:33,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:33,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:33,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:33,519 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-27 06:06:33,630 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2018-10-27 06:06:33,983 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-10-27 06:06:34,201 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2018-10-27 06:06:34,246 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:34,246 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:34,246 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:34,247 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:34,247 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:34,247 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:34,247 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:34,247 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:34,247 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:06:34,247 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:34,247 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:34,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:34,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:34,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:34,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:34,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:34,985 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:34,985 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:34,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:34,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:34,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:34,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:34,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:34,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:34,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:34,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:34,994 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-10-27 06:06:34,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:34,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:34,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:34,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:34,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:34,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:34,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:34,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:34,996 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-10-27 06:06:34,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:35,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:35,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:35,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:35,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:35,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:35,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:35,009 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-10-27 06:06:35,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:35,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:35,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:35,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:35,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:35,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:35,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:35,012 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-10-27 06:06:35,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:35,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:35,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:35,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:35,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:35,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:35,051 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:35,065 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:06:35,065 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:06:35,066 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:35,067 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:35,067 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:35,067 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_#t~ret9 + 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:06:35,146 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:06:35,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:35,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:35,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:35,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:06:35,635 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-10-27 06:06:35,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:35,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:35,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:35,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-10-27 06:06:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:35,666 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2018-10-27 06:06:35,666 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 95 transitions. cyclomatic complexity: 14 Second operand 10 states. [2018-10-27 06:06:35,843 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 95 transitions. cyclomatic complexity: 14. Second operand 10 states. Result 286 states and 317 transitions. Complement of second has 29 states. [2018-10-27 06:06:35,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:06:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2018-10-27 06:06:35,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 25 letters. Loop has 13 letters. [2018-10-27 06:06:35,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:35,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 38 letters. Loop has 13 letters. [2018-10-27 06:06:35,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:35,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 25 letters. Loop has 26 letters. [2018-10-27 06:06:35,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:35,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286 states and 317 transitions. [2018-10-27 06:06:35,851 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:06:35,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286 states to 195 states and 216 transitions. [2018-10-27 06:06:35,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2018-10-27 06:06:35,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2018-10-27 06:06:35,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 216 transitions. [2018-10-27 06:06:35,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:35,856 INFO L705 BuchiCegarLoop]: Abstraction has 195 states and 216 transitions. [2018-10-27 06:06:35,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 216 transitions. [2018-10-27 06:06:35,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 179. [2018-10-27 06:06:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-27 06:06:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 199 transitions. [2018-10-27 06:06:35,872 INFO L728 BuchiCegarLoop]: Abstraction has 179 states and 199 transitions. [2018-10-27 06:06:35,873 INFO L608 BuchiCegarLoop]: Abstraction has 179 states and 199 transitions. [2018-10-27 06:06:35,873 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:06:35,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 199 transitions. [2018-10-27 06:06:35,876 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-10-27 06:06:35,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:35,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:35,879 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:35,879 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:35,879 INFO L793 eck$LassoCheckResult]: Stem: 1165#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1156#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 1157#L20-3 assume true; 1138#L20-1 assume !!(main_~i~0 > 0);#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];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 1146#L22 SUMMARY for call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4); srcloc: L22 1160#L22-1 havoc main_#t~nondet8; 1154#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1176#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 1229#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 1230#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 1180#L10 SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 4); srcloc: L10 1153#L10-1 ~pv~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~pv~0; 1155#recFINAL assume true; 1174#recEXIT >#40#return; 1175#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 1135#L20-3 assume true; 1136#L20-1 assume !!(main_~i~0 > 0);#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];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 1258#L22 SUMMARY for call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4); srcloc: L22 1158#L22-1 havoc main_#t~nondet8; 1159#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1256#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 1255#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 1254#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1; 1253#L14 SUMMARY for call #t~mem3 := read~int(~p.base, ~p.offset, 4); srcloc: L14 1252#L14-1 #t~post4 := #t~mem3; 1251#L14-2 SUMMARY for call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4); srcloc: L14-2 1250#L14-3 havoc #t~post4;havoc #t~mem3; 1126#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 1247#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 1249#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 1290#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 1289#L10 SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 4); srcloc: L10 1152#L10-1 ~pv~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~pv~0; 1127#recFINAL assume true; 1177#recEXIT >#38#return; 1271#L15-1 #res := #t~ret5;havoc #t~ret5; 1269#recFINAL assume true; 1267#recEXIT >#40#return; 1167#L23-1 [2018-10-27 06:06:35,879 INFO L795 eck$LassoCheckResult]: Loop: 1167#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 1168#L20-3 assume true; 1246#L20-1 assume !!(main_~i~0 > 0);#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];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 1245#L22 SUMMARY for call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4); srcloc: L22 1244#L22-1 havoc main_#t~nondet8; 1234#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1236#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 1243#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 1241#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 1242#L10 SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 4); srcloc: L10 1272#L10-1 ~pv~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~pv~0; 1232#recFINAL assume true; 1235#recEXIT >#40#return; 1167#L23-1 [2018-10-27 06:06:35,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:35,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1149428214, now seen corresponding path program 2 times [2018-10-27 06:06:35,880 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:35,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:35,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:35,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:35,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:35,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:35,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1920162748, now seen corresponding path program 3 times [2018-10-27 06:06:35,921 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:35,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:35,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:35,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:35,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:35,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:35,935 INFO L82 PathProgramCache]: Analyzing trace with hash -125627309, now seen corresponding path program 3 times [2018-10-27 06:06:35,935 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:35,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:35,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:35,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:35,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:36,262 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 06:06:36,450 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2018-10-27 06:06:36,874 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-10-27 06:06:37,459 WARN L179 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 160 [2018-10-27 06:06:37,571 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-10-27 06:06:37,573 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:37,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:37,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:37,574 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:37,574 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:37,574 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:37,574 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:37,574 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:37,574 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration4_Lasso [2018-10-27 06:06:37,574 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:37,574 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:37,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,770 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2018-10-27 06:06:37,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:37,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:38,193 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:38,193 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:38,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-10-27 06:06:38,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:38,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:38,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:38,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:38,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:38,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:38,200 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:38,201 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-10-27 06:06:38,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:38,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:38,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:38,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:38,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:38,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:38,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:38,209 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-10-27 06:06:38,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:38,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:38,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:38,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:38,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:38,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:38,218 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:38,219 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-10-27 06:06:38,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:38,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:38,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:38,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:38,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:38,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:38,225 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:38,225 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-10-27 06:06:38,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:38,226 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:38,226 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:38,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:38,232 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-10-27 06:06:38,232 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:06:38,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:38,251 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-10-27 06:06:38,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:38,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:38,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:38,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:38,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:38,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:38,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:38,259 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-10-27 06:06:38,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:38,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:38,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:38,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:38,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:38,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:38,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:38,267 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-10-27 06:06:38,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:38,268 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:38,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:38,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:38,272 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:38,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:38,273 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:38,274 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-10-27 06:06:38,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:38,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:38,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:38,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:38,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:38,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:38,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:38,290 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-10-27 06:06:38,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:38,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:38,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:38,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:38,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:38,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:38,306 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:38,323 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:06:38,324 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-10-27 06:06:38,324 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:38,326 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:38,326 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:38,326 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_#t~ret9 + 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:06:38,405 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:06:38,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:38,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:38,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:38,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:06:38,567 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-10-27 06:06:38,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:38,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:38,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:38,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-10-27 06:06:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:38,601 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2018-10-27 06:06:38,602 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 199 transitions. cyclomatic complexity: 27 Second operand 10 states. [2018-10-27 06:06:38,753 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 199 transitions. cyclomatic complexity: 27. Second operand 10 states. Result 304 states and 337 transitions. Complement of second has 29 states. [2018-10-27 06:06:38,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:06:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2018-10-27 06:06:38,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 38 letters. Loop has 13 letters. [2018-10-27 06:06:38,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:38,757 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:06:38,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:38,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:38,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:38,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:06:38,980 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-10-27 06:06:38,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:38,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:38,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:38,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-10-27 06:06:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:39,060 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2018-10-27 06:06:39,061 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 199 transitions. cyclomatic complexity: 27 Second operand 10 states. [2018-10-27 06:06:39,354 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 199 transitions. cyclomatic complexity: 27. Second operand 10 states. Result 304 states and 337 transitions. Complement of second has 29 states. [2018-10-27 06:06:39,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:06:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2018-10-27 06:06:39,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 38 letters. Loop has 13 letters. [2018-10-27 06:06:39,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:39,356 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:06:39,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:39,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:39,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:39,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:06:39,501 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-10-27 06:06:39,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:39,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:39,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:39,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-10-27 06:06:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:39,541 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2018-10-27 06:06:39,541 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 199 transitions. cyclomatic complexity: 27 Second operand 10 states. [2018-10-27 06:06:39,719 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 199 transitions. cyclomatic complexity: 27. Second operand 10 states. Result 356 states and 396 transitions. Complement of second has 30 states. [2018-10-27 06:06:39,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:06:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2018-10-27 06:06:39,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 48 transitions. Stem has 38 letters. Loop has 13 letters. [2018-10-27 06:06:39,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:39,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 48 transitions. Stem has 51 letters. Loop has 13 letters. [2018-10-27 06:06:39,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:39,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 48 transitions. Stem has 38 letters. Loop has 26 letters. [2018-10-27 06:06:39,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:39,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 356 states and 396 transitions. [2018-10-27 06:06:39,732 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2018-10-27 06:06:39,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 356 states to 220 states and 244 transitions. [2018-10-27 06:06:39,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2018-10-27 06:06:39,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2018-10-27 06:06:39,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 244 transitions. [2018-10-27 06:06:39,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:39,738 INFO L705 BuchiCegarLoop]: Abstraction has 220 states and 244 transitions. [2018-10-27 06:06:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 244 transitions. [2018-10-27 06:06:39,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 110. [2018-10-27 06:06:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-27 06:06:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2018-10-27 06:06:39,750 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 122 transitions. [2018-10-27 06:06:39,750 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 122 transitions. [2018-10-27 06:06:39,750 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:06:39,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 122 transitions. [2018-10-27 06:06:39,751 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-10-27 06:06:39,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:39,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:39,756 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:39,756 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:39,756 INFO L793 eck$LassoCheckResult]: Stem: 2931#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2925#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 2926#L20-3 assume true; 2955#L20-1 assume !!(main_~i~0 > 0);#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];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 2975#L22 SUMMARY for call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4); srcloc: L22 2927#L22-1 havoc main_#t~nondet8; 2893#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 2899#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 2900#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 2971#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1; 2892#L14 SUMMARY for call #t~mem3 := read~int(~p.base, ~p.offset, 4); srcloc: L14 2894#L14-1 #t~post4 := #t~mem3; 2904#L14-2 SUMMARY for call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4); srcloc: L14-2 2967#L14-3 havoc #t~post4;havoc #t~mem3; 2890#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 2957#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 2965#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 2992#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 2991#L10 SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 4); srcloc: L10 2921#L10-1 ~pv~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~pv~0; 2891#recFINAL assume true; 2940#recEXIT >#38#return; 2956#L15-1 #res := #t~ret5;havoc #t~ret5; 2951#recFINAL assume true; 2947#recEXIT >#40#return; 2932#L23-1 [2018-10-27 06:06:39,756 INFO L795 eck$LassoCheckResult]: Loop: 2932#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 2906#L20-3 assume true; 2907#L20-1 assume !!(main_~i~0 > 0);#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];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 2914#L22 SUMMARY for call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4); srcloc: L22 2934#L22-1 havoc main_#t~nondet8; 2911#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 2973#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 2972#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 2970#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1; 2969#L14 SUMMARY for call #t~mem3 := read~int(~p.base, ~p.offset, 4); srcloc: L14 2968#L14-1 #t~post4 := #t~mem3; 2910#L14-2 SUMMARY for call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4); srcloc: L14-2 2912#L14-3 havoc #t~post4;havoc #t~mem3; 2917#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 2918#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 2964#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 2962#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 2963#L10 SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 4); srcloc: L10 2986#L10-1 ~pv~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~pv~0; 2985#recFINAL assume true; 2983#recEXIT >#38#return; 2952#L15-1 #res := #t~ret5;havoc #t~ret5; 2953#recFINAL assume true; 2974#recEXIT >#40#return; 2932#L23-1 [2018-10-27 06:06:39,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:39,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1668433253, now seen corresponding path program 2 times [2018-10-27 06:06:39,756 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:39,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:39,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:39,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:39,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:39,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:39,780 INFO L82 PathProgramCache]: Analyzing trace with hash -284521366, now seen corresponding path program 1 times [2018-10-27 06:06:39,780 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:39,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:39,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:39,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:39,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:39,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:39,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1142678990, now seen corresponding path program 4 times [2018-10-27 06:06:39,798 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:39,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:39,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:39,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:39,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:40,233 WARN L179 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 06:06:40,571 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-27 06:06:40,701 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-27 06:06:40,909 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-10-27 06:06:41,152 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-10-27 06:06:41,613 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2018-10-27 06:06:41,685 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:41,685 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:41,686 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:41,686 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:41,686 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:41,686 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:41,686 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:41,686 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:41,686 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration5_Lasso [2018-10-27 06:06:41,686 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:41,686 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:41,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,961 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-10-27 06:06:41,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:42,234 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:42,234 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:42,235 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-10-27 06:06:42,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:42,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:42,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:42,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:42,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:42,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:42,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:42,239 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-10-27 06:06:42,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:42,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:42,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:42,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:42,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:42,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:42,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:42,241 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-10-27 06:06:42,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:42,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:42,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:42,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:42,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:42,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:42,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:42,243 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:42,243 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-10-27 06:06:42,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:42,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:42,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:42,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:42,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:42,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:42,253 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:42,266 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-10-27 06:06:42,266 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:06:42,266 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:42,267 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-10-27 06:06:42,267 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:42,268 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [-1*ULTIMATE.start_main_#t~ret9 - 1 >= 0] [2018-10-27 06:06:42,355 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-10-27 06:06:42,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:42,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:42,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-10-27 06:06:42,451 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-10-27 06:06:42,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:42,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:42,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-27 06:06:42,458 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-10-27 06:06:42,459 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:42,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:42,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:42,470 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:19 [2018-10-27 06:06:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:42,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:42,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:06:42,683 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-10-27 06:06:42,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:42,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:42,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:42,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-10-27 06:06:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 06:06:42,732 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 9 loop predicates [2018-10-27 06:06:42,732 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 122 transitions. cyclomatic complexity: 16 Second operand 16 states. [2018-10-27 06:06:43,074 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 122 transitions. cyclomatic complexity: 16. Second operand 16 states. Result 198 states and 218 transitions. Complement of second has 20 states. [2018-10-27 06:06:43,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 1 non-accepting loop states 2 accepting loop states [2018-10-27 06:06:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-27 06:06:43,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2018-10-27 06:06:43,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 28 transitions. Stem has 25 letters. Loop has 24 letters. [2018-10-27 06:06:43,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:43,076 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:06:43,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:43,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:43,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-10-27 06:06:43,181 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-10-27 06:06:43,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:43,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:43,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-27 06:06:43,191 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-10-27 06:06:43,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:43,195 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:43,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:43,204 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:19 [2018-10-27 06:06:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:43,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:43,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:06:43,359 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-10-27 06:06:43,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:43,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:43,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:43,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-10-27 06:06:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 06:06:43,407 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 9 loop predicates [2018-10-27 06:06:43,407 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 122 transitions. cyclomatic complexity: 16 Second operand 16 states. [2018-10-27 06:06:43,852 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 122 transitions. cyclomatic complexity: 16. Second operand 16 states. Result 286 states and 319 transitions. Complement of second has 48 states. [2018-10-27 06:06:43,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 8 stem states 9 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:43,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-27 06:06:43,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 49 transitions. [2018-10-27 06:06:43,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 49 transitions. Stem has 25 letters. Loop has 24 letters. [2018-10-27 06:06:43,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:43,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 49 transitions. Stem has 49 letters. Loop has 24 letters. [2018-10-27 06:06:43,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:43,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 49 transitions. Stem has 25 letters. Loop has 48 letters. [2018-10-27 06:06:43,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:43,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286 states and 319 transitions. [2018-10-27 06:06:43,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:06:43,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286 states to 199 states and 222 transitions. [2018-10-27 06:06:43,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2018-10-27 06:06:43,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2018-10-27 06:06:43,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 222 transitions. [2018-10-27 06:06:43,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:43,866 INFO L705 BuchiCegarLoop]: Abstraction has 199 states and 222 transitions. [2018-10-27 06:06:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 222 transitions. [2018-10-27 06:06:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 173. [2018-10-27 06:06:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-27 06:06:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 193 transitions. [2018-10-27 06:06:43,882 INFO L728 BuchiCegarLoop]: Abstraction has 173 states and 193 transitions. [2018-10-27 06:06:43,882 INFO L608 BuchiCegarLoop]: Abstraction has 173 states and 193 transitions. [2018-10-27 06:06:43,882 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:06:43,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 193 transitions. [2018-10-27 06:06:43,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:06:43,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:43,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:43,887 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:43,888 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:43,888 INFO L793 eck$LassoCheckResult]: Stem: 3995#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3986#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 3987#L20-3 assume true; 4024#L20-1 assume !!(main_~i~0 > 0);#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];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 4025#L22 SUMMARY for call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4); srcloc: L22 4021#L22-1 havoc main_#t~nondet8; 4018#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 4019#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 4039#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 4038#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1; 4037#L14 SUMMARY for call #t~mem3 := read~int(~p.base, ~p.offset, 4); srcloc: L14 4034#L14-1 #t~post4 := #t~mem3; 4033#L14-2 SUMMARY for call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4); srcloc: L14-2 4029#L14-3 havoc #t~post4;havoc #t~mem3; 3961#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 4026#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 4050#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 4035#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 4036#L10 SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 4); srcloc: L10 3990#L10-1 ~pv~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~pv~0; 3962#recFINAL assume true; 4011#recEXIT >#38#return; 4022#L15-1 #res := #t~ret5;havoc #t~ret5; 4020#recFINAL assume true; 4017#recEXIT >#40#return; 3999#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 4000#L20-3 assume true; 3980#L20-1 assume !!(main_~i~0 > 0);#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];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 3981#L22 SUMMARY for call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4); srcloc: L22 3992#L22-1 havoc main_#t~nondet8; 3954#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 3965#recENTRY [2018-10-27 06:06:43,888 INFO L795 eck$LassoCheckResult]: Loop: 3965#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 3966#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 3988#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1; 3953#L14 SUMMARY for call #t~mem3 := read~int(~p.base, ~p.offset, 4); srcloc: L14 3955#L14-1 #t~post4 := #t~mem3; 3972#L14-2 SUMMARY for call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4); srcloc: L14-2 3978#L14-3 havoc #t~post4;havoc #t~mem3; 3956#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 3965#recENTRY [2018-10-27 06:06:43,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:43,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1462058682, now seen corresponding path program 5 times [2018-10-27 06:06:43,888 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:43,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:43,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:43,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:43,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:43,914 INFO L82 PathProgramCache]: Analyzing trace with hash -711880450, now seen corresponding path program 2 times [2018-10-27 06:06:43,914 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:43,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:43,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:43,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:43,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:43,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1836237501, now seen corresponding path program 6 times [2018-10-27 06:06:43,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:43,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:44,655 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 130 [2018-10-27 06:06:44,806 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:44,807 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:44,807 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:44,807 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:44,807 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:44,807 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:44,807 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:44,807 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:44,807 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3_true-termination.c.i_Iteration6_Lasso [2018-10-27 06:06:44,807 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:44,807 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:44,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,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-10-27 06:06:44,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-10-27 06:06:44,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,082 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:45,082 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:45,082 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-10-27 06:06:45,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,084 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,084 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-10-27 06:06:45,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:45,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:45,090 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,091 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-10-27 06:06:45,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,092 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,099 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-10-27 06:06:45,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,101 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-10-27 06:06:45,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,103 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-10-27 06:06:45,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,104 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,108 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-10-27 06:06:45,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:45,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:45,110 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,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-10-27 06:06:45,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,112 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-10-27 06:06:45,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,123 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,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-10-27 06:06:45,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,130 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,130 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-10-27 06:06:45,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,132 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,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-10-27 06:06:45,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,136 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,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-10-27 06:06:45,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,138 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-10-27 06:06:45,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,146 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,146 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-10-27 06:06:45,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,148 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,148 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-10-27 06:06:45,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,158 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-10-27 06:06:45,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,160 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,160 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-10-27 06:06:45,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,166 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,167 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-10-27 06:06:45,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,168 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,168 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-10-27 06:06:45,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:45,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:45,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:45,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:45,178 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-10-27 06:06:45,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:45,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:45,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:45,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:45,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:45,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:45,193 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:45,196 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:45,196 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:06:45,196 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:45,206 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:45,207 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:45,207 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2 + 1 Supporting invariants [] [2018-10-27 06:06:45,253 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-10-27 06:06:45,269 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:45,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:45,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:45,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:45,494 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:45,495 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-10-27 06:06:45,517 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-10-27 06:06:45,518 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:06:45,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:06:45,802 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-10-27 06:06:45,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-10-27 06:06:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:45,817 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-10-27 06:06:45,817 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 173 states and 193 transitions. cyclomatic complexity: 26 Second operand 9 states. [2018-10-27 06:06:46,048 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 173 states and 193 transitions. cyclomatic complexity: 26. Second operand 9 states. Result 237 states and 257 transitions. Complement of second has 32 states. [2018-10-27 06:06:46,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:06:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2018-10-27 06:06:46,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 31 letters. Loop has 8 letters. [2018-10-27 06:06:46,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:46,058 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:06:46,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:46,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:46,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:46,512 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:46,513 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-10-27 06:06:46,516 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-10-27 06:06:46,517 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:06:46,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:06:46,529 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-10-27 06:06:46,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-10-27 06:06:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:46,544 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-10-27 06:06:46,544 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 173 states and 193 transitions. cyclomatic complexity: 26 Second operand 9 states. [2018-10-27 06:06:46,713 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 173 states and 193 transitions. cyclomatic complexity: 26. Second operand 9 states. Result 237 states and 257 transitions. Complement of second has 32 states. [2018-10-27 06:06:46,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:06:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2018-10-27 06:06:46,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 31 letters. Loop has 8 letters. [2018-10-27 06:06:46,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:46,716 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:06:46,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:46,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:46,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:46,826 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:46,827 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-10-27 06:06:46,829 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-10-27 06:06:46,830 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:06:46,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:06:46,846 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-10-27 06:06:46,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-10-27 06:06:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:46,868 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-10-27 06:06:46,868 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 173 states and 193 transitions. cyclomatic complexity: 26 Second operand 9 states. [2018-10-27 06:06:47,050 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 173 states and 193 transitions. cyclomatic complexity: 26. Second operand 9 states. Result 333 states and 355 transitions. Complement of second has 33 states. [2018-10-27 06:06:47,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:06:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-10-27 06:06:47,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 39 transitions. Stem has 31 letters. Loop has 8 letters. [2018-10-27 06:06:47,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:47,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 39 transitions. Stem has 39 letters. Loop has 8 letters. [2018-10-27 06:06:47,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:47,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 39 transitions. Stem has 31 letters. Loop has 16 letters. [2018-10-27 06:06:47,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:47,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 333 states and 355 transitions. [2018-10-27 06:06:47,060 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:47,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 333 states to 0 states and 0 transitions. [2018-10-27 06:06:47,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:06:47,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:06:47,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:06:47,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:47,061 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:47,061 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:47,061 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:47,061 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:06:47,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:06:47,061 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:47,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:06:47,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:06:47 BoogieIcfgContainer [2018-10-27 06:06:47,068 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:06:47,069 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:06:47,069 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:06:47,069 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:06:47,070 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:28" (3/4) ... [2018-10-27 06:06:47,074 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:06:47,074 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:06:47,074 INFO L168 Benchmark]: Toolchain (without parser) took 19528.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.1 MB). Free memory was 961.1 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 121.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:47,075 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:47,076 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.69 ms. Allocated memory is still 1.0 GB. Free memory was 961.1 MB in the beginning and 950.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:47,076 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.27 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 947.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:47,076 INFO L168 Benchmark]: Boogie Preprocessor took 21.27 ms. Allocated memory is still 1.0 GB. Free memory is still 947.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:47,077 INFO L168 Benchmark]: RCFGBuilder took 505.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.7 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:47,077 INFO L168 Benchmark]: BuchiAutomizer took 18759.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 702.9 kB). Peak memory consumption was 142.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:47,078 INFO L168 Benchmark]: Witness Printer took 4.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:47,081 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 196.69 ms. Allocated memory is still 1.0 GB. Free memory was 961.1 MB in the beginning and 950.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.27 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 947.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.27 ms. Allocated memory is still 1.0 GB. Free memory is still 947.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 505.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.7 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18759.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 702.9 kB). Peak memory consumption was 142.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function i and consists of 11 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 9 locations. One deterministic module has affine ranking function aux-rec(op)-aux + i and consists of 10 locations. One deterministic module has affine ranking function i and consists of 18 locations. One nondeterministic module has affine ranking function aux-rec(op)-aux + i and consists of 10 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.7s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 12.0s. Construction of modules took 1.0s. Büchi inclusion checks took 5.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 160 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 179 states and ocurred in iteration 3. Nontrivial modules had stage [3, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 5/5 HoareTripleCheckerStatistics: 267 SDtfs, 414 SDslu, 596 SDs, 0 SdLazy, 881 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital189 mio100 ax100 hnf100 lsp96 ukn67 mio100 lsp32 div100 bol100 ite100 ukn100 eq180 hnf88 smp92 dnf106 smp100 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 3 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...