./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a1da20de-0a2f-4116-9083-8c7b107bf3a2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a1da20de-0a2f-4116-9083-8c7b107bf3a2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a1da20de-0a2f-4116-9083-8c7b107bf3a2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a1da20de-0a2f-4116-9083-8c7b107bf3a2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a1da20de-0a2f-4116-9083-8c7b107bf3a2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a1da20de-0a2f-4116-9083-8c7b107bf3a2/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 32bit --witnessprinter.graph.data.programhash 986c31897144a5b76f321e97eaa1d3383cce25ed .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:08:14,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:08:14,714 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:08:14,724 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:08:14,724 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:08:14,725 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:08:14,726 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:08:14,728 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:08:14,732 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:08:14,732 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:08:14,733 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:08:14,733 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:08:14,734 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:08:14,737 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:08:14,738 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:08:14,738 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:08:14,739 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:08:14,740 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:08:14,742 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:08:14,754 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:08:14,755 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:08:14,756 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:08:14,757 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:08:14,760 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:08:14,760 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:08:14,761 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:08:14,762 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:08:14,762 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:08:14,763 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:08:14,764 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:08:14,764 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:08:14,764 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:08:14,764 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:08:14,765 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:08:14,765 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:08:14,766 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:08:14,766 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a1da20de-0a2f-4116-9083-8c7b107bf3a2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:08:14,785 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:08:14,785 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:08:14,787 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:08:14,787 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:08:14,788 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:08:14,788 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:08:14,788 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:08:14,788 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:08:14,788 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:08:14,789 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:08:14,789 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:08:14,789 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:08:14,789 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:08:14,789 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:08:14,789 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:08:14,789 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:08:14,790 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:08:14,790 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:08:14,790 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:08:14,790 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:08:14,790 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:08:14,790 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:08:14,790 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:08:14,791 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:08:14,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:08:14,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:08:14,791 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:08:14,791 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:08:14,791 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:08:14,791 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:08:14,792 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:08:14,792 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_a1da20de-0a2f-4116-9083-8c7b107bf3a2/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 986c31897144a5b76f321e97eaa1d3383cce25ed [2018-10-27 06:08:14,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:08:14,829 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:08:14,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:08:14,833 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:08:14,833 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:08:14,834 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a1da20de-0a2f-4116-9083-8c7b107bf3a2/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:08:14,876 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a1da20de-0a2f-4116-9083-8c7b107bf3a2/bin-2019/uautomizer/data/27cc45b29/ae66ee3ff43e4b4dbf25e4b0a091cc5f/FLAG77a89901c [2018-10-27 06:08:15,305 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:08:15,307 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a1da20de-0a2f-4116-9083-8c7b107bf3a2/sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:08:15,319 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a1da20de-0a2f-4116-9083-8c7b107bf3a2/bin-2019/uautomizer/data/27cc45b29/ae66ee3ff43e4b4dbf25e4b0a091cc5f/FLAG77a89901c [2018-10-27 06:08:15,330 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a1da20de-0a2f-4116-9083-8c7b107bf3a2/bin-2019/uautomizer/data/27cc45b29/ae66ee3ff43e4b4dbf25e4b0a091cc5f [2018-10-27 06:08:15,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:08:15,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:08:15,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:15,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:08:15,339 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:08:15,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:15" (1/1) ... [2018-10-27 06:08:15,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51aa830b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:15, skipping insertion in model container [2018-10-27 06:08:15,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:15" (1/1) ... [2018-10-27 06:08:15,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:08:15,385 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:08:15,645 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:15,656 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:08:15,697 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:15,743 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:08:15,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:15 WrapperNode [2018-10-27 06:08:15,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:15,744 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:15,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:08:15,745 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:08:15,755 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:08:15" (1/1) ... [2018-10-27 06:08:15,771 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:08:15" (1/1) ... [2018-10-27 06:08:15,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:15,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:08:15,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:08:15,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:08:15,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:15" (1/1) ... [2018-10-27 06:08:15,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:15" (1/1) ... [2018-10-27 06:08:15,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:15" (1/1) ... [2018-10-27 06:08:15,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:15" (1/1) ... [2018-10-27 06:08:15,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:15" (1/1) ... [2018-10-27 06:08:15,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:15" (1/1) ... [2018-10-27 06:08:15,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:15" (1/1) ... [2018-10-27 06:08:15,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:08:15,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:08:15,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:08:15,917 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:08:15,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1da20de-0a2f-4116-9083-8c7b107bf3a2/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:08:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:08:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:08:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:08:15,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:08:16,400 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:08:16,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:16 BoogieIcfgContainer [2018-10-27 06:08:16,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:08:16,401 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:08:16,401 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:08:16,405 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:08:16,405 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:16,406 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:08:15" (1/3) ... [2018-10-27 06:08:16,407 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@117c2969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:16, skipping insertion in model container [2018-10-27 06:08:16,408 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:16,408 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:15" (2/3) ... [2018-10-27 06:08:16,408 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@117c2969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:16, skipping insertion in model container [2018-10-27 06:08:16,408 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:16,408 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:16" (3/3) ... [2018-10-27 06:08:16,410 INFO L375 chiAutomizerObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:08:16,462 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:08:16,463 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:08:16,463 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:08:16,463 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:08:16,464 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:08:16,464 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:08:16,464 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:08:16,464 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:08:16,464 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:08:16,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-10-27 06:08:16,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-10-27 06:08:16,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:16,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:16,504 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:16,505 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:16,505 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:08:16,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-10-27 06:08:16,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-10-27 06:08:16,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:16,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:16,507 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:16,507 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:16,515 INFO L793 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 9#L567true assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 14#L567-2true assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 3#L570-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 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~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 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~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 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~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 13#L547-3true [2018-10-27 06:08:16,515 INFO L795 eck$LassoCheckResult]: Loop: 13#L547-3true assume true; 8#L547-1true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 5#L551-4true assume !true; 6#L550-3true assume !(diff_~found~0 == 0); 10#L557-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 13#L547-3true [2018-10-27 06:08:16,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:16,524 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-10-27 06:08:16,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:16,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:16,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:16,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:16,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash 46965800, now seen corresponding path program 1 times [2018-10-27 06:08:16,644 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:16,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:16,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:16,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:16,674 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:08:16,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:16,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:08:16,682 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:16,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:08:16,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:08:16,701 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-10-27 06:08:16,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:16,709 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-10-27 06:08:16,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:08:16,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-10-27 06:08:16,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-10-27 06:08:16,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 22 transitions. [2018-10-27 06:08:16,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-10-27 06:08:16,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-10-27 06:08:16,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-10-27 06:08:16,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:16,721 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-10-27 06:08:16,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-10-27 06:08:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-27 06:08:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-27 06:08:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-10-27 06:08:16,752 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-10-27 06:08:16,752 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-10-27 06:08:16,752 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:08:16,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2018-10-27 06:08:16,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-10-27 06:08:16,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:16,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:16,754 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:16,754 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:16,754 INFO L793 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 60#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 61#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 50#L570-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 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~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 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~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 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~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 51#L547-3 [2018-10-27 06:08:16,754 INFO L795 eck$LassoCheckResult]: Loop: 51#L547-3 assume true; 59#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 54#L551-4 assume true; 55#L550-1 assume !(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 56#L550-3 assume !(diff_~found~0 == 0); 57#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 51#L547-3 [2018-10-27 06:08:16,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:16,759 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-10-27 06:08:16,759 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:16,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:16,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:16,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:16,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:16,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1455442957, now seen corresponding path program 1 times [2018-10-27 06:08:16,790 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:16,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:16,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:16,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:16,841 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:08:16,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:16,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:08:16,842 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:16,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:08:16,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:08:16,842 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-10-27 06:08:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:16,915 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-10-27 06:08:16,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:08:16,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2018-10-27 06:08:16,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-10-27 06:08:16,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 29 transitions. [2018-10-27 06:08:16,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-10-27 06:08:16,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-10-27 06:08:16,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-10-27 06:08:16,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:16,919 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-10-27 06:08:16,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-10-27 06:08:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-10-27 06:08:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-27 06:08:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-10-27 06:08:16,921 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-10-27 06:08:16,921 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-10-27 06:08:16,921 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:08:16,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-10-27 06:08:16,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:08:16,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:16,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:16,925 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:16,925 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:16,925 INFO L793 eck$LassoCheckResult]: Stem: 109#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 108#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 105#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 106#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 96#L570-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 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~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 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~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 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~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 97#L547-3 [2018-10-27 06:08:16,926 INFO L795 eck$LassoCheckResult]: Loop: 97#L547-3 assume true; 104#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 100#L551-4 assume true; 101#L550-1 assume !(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 102#L550-3 assume diff_~found~0 == 0; 98#L558 SUMMARY for call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L558 99#L558-1 SUMMARY for call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + diff_~k~0 * 4, 4); srcloc: L558-1 103#L558-2 havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := diff_#t~post6 + 1;havoc diff_#t~post6; 107#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 97#L547-3 [2018-10-27 06:08:16,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:16,926 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2018-10-27 06:08:16,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:16,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:16,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:16,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:16,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:16,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1401533195, now seen corresponding path program 1 times [2018-10-27 06:08:16,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:16,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:16,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:16,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:16,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:16,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1410862234, now seen corresponding path program 1 times [2018-10-27 06:08:16,971 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:16,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:16,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:16,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:17,105 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:08:17,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:17,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:08:17,254 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-10-27 06:08:17,416 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-10-27 06:08:17,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:08:17,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:08:17,416 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-10-27 06:08:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:17,585 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2018-10-27 06:08:17,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:08:17,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2018-10-27 06:08:17,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-10-27 06:08:17,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2018-10-27 06:08:17,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-10-27 06:08:17,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-10-27 06:08:17,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2018-10-27 06:08:17,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:17,589 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-10-27 06:08:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2018-10-27 06:08:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-10-27 06:08:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-27 06:08:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-10-27 06:08:17,592 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-10-27 06:08:17,592 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-10-27 06:08:17,593 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:08:17,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2018-10-27 06:08:17,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:08:17,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:17,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:17,595 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:17,595 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:17,595 INFO L793 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 167#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 164#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 165#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 155#L570-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 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~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 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~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 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~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 156#L547-3 [2018-10-27 06:08:17,596 INFO L795 eck$LassoCheckResult]: Loop: 156#L547-3 assume true; 163#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 159#L551-4 assume true; 160#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 169#L551 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L551 170#L551-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L551-1 171#L551-2 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 172#L551-4 assume true; 175#L550-1 assume !(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 174#L550-3 assume !(diff_~found~0 == 0); 166#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 156#L547-3 [2018-10-27 06:08:17,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:17,596 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2018-10-27 06:08:17,596 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:17,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:17,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:17,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:17,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1591366400, now seen corresponding path program 1 times [2018-10-27 06:08:17,624 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:17,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:17,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:17,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:17,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1526022811, now seen corresponding path program 1 times [2018-10-27 06:08:17,641 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:17,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:17,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:17,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:17,928 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-10-27 06:08:18,083 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 06:08:18,543 WARN L179 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-10-27 06:08:18,740 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-10-27 06:08:18,763 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:18,765 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:18,765 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:18,765 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:18,765 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:18,765 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:18,765 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:18,765 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:18,766 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-10-27 06:08:18,766 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:18,766 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:18,789 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:08:18,805 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:08:18,807 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:08:18,815 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:08:18,819 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:08:18,826 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:08:18,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:08:18,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:18,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:08:18,847 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:08:19,312 WARN L179 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 116 [2018-10-27 06:08:19,361 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:08:19,368 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:08:19,370 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:08:19,372 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:08:19,373 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:08:19,971 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:19,976 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:19,978 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:08:19,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:19,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:19,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:19,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:19,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:19,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:19,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:19,986 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:19,987 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:08:19,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:19,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:19,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:19,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:19,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:19,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:19,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:19,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:19,989 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:08:19,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:19,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:19,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:19,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:19,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:19,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,001 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:08:20,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:20,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,010 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:08:20,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:20,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:20,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:20,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:20,026 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:20,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,037 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:08:20,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:20,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:20,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:20,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:20,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:20,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:20,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,048 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:08:20,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:20,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,056 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:08:20,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:20,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,072 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,072 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:08:20,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:20,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,126 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:20,185 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:08:20,185 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:08:20,187 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:20,189 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:20,190 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:20,190 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 Supporting invariants [] [2018-10-27 06:08:20,295 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-10-27 06:08:20,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:20,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:20,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 06:08:20,374 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:08:20,375 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-10-27 06:08:20,433 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 39 states and 50 transitions. Complement of second has 6 states. [2018-10-27 06:08:20,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-10-27 06:08:20,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 5 letters. Loop has 11 letters. [2018-10-27 06:08:20,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:20,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 16 letters. Loop has 11 letters. [2018-10-27 06:08:20,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:20,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 5 letters. Loop has 22 letters. [2018-10-27 06:08:20,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:20,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2018-10-27 06:08:20,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:08:20,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 33 states and 42 transitions. [2018-10-27 06:08:20,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-10-27 06:08:20,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-10-27 06:08:20,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2018-10-27 06:08:20,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:20,441 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2018-10-27 06:08:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2018-10-27 06:08:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-10-27 06:08:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-27 06:08:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-10-27 06:08:20,445 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-10-27 06:08:20,445 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-10-27 06:08:20,445 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:08:20,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2018-10-27 06:08:20,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:08:20,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:20,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:20,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:20,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:20,448 INFO L793 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 360#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 361#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 347#L570-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 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~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 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~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 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~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 348#L547-3 assume true; 357#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 351#L551-4 [2018-10-27 06:08:20,448 INFO L795 eck$LassoCheckResult]: Loop: 351#L551-4 assume true; 352#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 366#L551 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L551 367#L551-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L551-1 370#L551-2 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 351#L551-4 [2018-10-27 06:08:20,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:20,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935596, now seen corresponding path program 1 times [2018-10-27 06:08:20,448 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:20,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:20,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:20,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:20,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:20,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:20,478 INFO L82 PathProgramCache]: Analyzing trace with hash 56489728, now seen corresponding path program 1 times [2018-10-27 06:08:20,481 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:20,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:20,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:20,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:20,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:20,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:20,499 INFO L82 PathProgramCache]: Analyzing trace with hash 2103604149, now seen corresponding path program 1 times [2018-10-27 06:08:20,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:20,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:20,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:20,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:20,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:20,922 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 123 [2018-10-27 06:08:21,130 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-10-27 06:08:21,132 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:21,132 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:21,132 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:21,132 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:21,132 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:21,132 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:21,133 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:21,133 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:21,133 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-10-27 06:08:21,133 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:21,133 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:21,137 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:08:21,144 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:08:21,146 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:08:21,148 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:08:21,150 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:08:21,157 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:08:21,158 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:08:21,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:21,162 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:08:21,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:21,565 WARN L179 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 122 [2018-10-27 06:08:21,632 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:08:21,633 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:08:21,635 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:08:21,637 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:08:21,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:22,093 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-10-27 06:08:22,475 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-10-27 06:08:22,506 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:22,506 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:22,507 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:08:22,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:22,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:22,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:22,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:22,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:22,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:22,519 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:22,522 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:22,522 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:22,522 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:22,525 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:22,525 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:22,525 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~found~0) = -2*ULTIMATE.start_diff_~found~0 + 1 Supporting invariants [] [2018-10-27 06:08:22,625 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-10-27 06:08:22,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:22,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:22,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:22,769 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:08:22,769 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:08:22,769 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-10-27 06:08:22,831 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 91 states and 114 transitions. Complement of second has 7 states. [2018-10-27 06:08:22,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:22,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-10-27 06:08:22,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 5 letters. [2018-10-27 06:08:22,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:22,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 12 letters. Loop has 5 letters. [2018-10-27 06:08:22,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:22,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 10 letters. [2018-10-27 06:08:22,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:22,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 114 transitions. [2018-10-27 06:08:22,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:08:22,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 87 states and 110 transitions. [2018-10-27 06:08:22,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-10-27 06:08:22,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-10-27 06:08:22,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2018-10-27 06:08:22,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:22,842 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-10-27 06:08:22,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2018-10-27 06:08:22,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2018-10-27 06:08:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-27 06:08:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2018-10-27 06:08:22,855 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-10-27 06:08:22,855 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-10-27 06:08:22,855 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:08:22,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 98 transitions. [2018-10-27 06:08:22,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:08:22,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:22,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:22,857 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:22,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:22,858 INFO L793 eck$LassoCheckResult]: Stem: 616#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 615#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 607#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 608#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 592#L570-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 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~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 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~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 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~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 593#L547-3 assume true; 612#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 634#L551-4 assume true; 597#L550-1 [2018-10-27 06:08:22,858 INFO L795 eck$LassoCheckResult]: Loop: 597#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 617#L551 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L551 618#L551-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L551-1 624#L551-2 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := diff_#t~post4 + 1;havoc diff_#t~post4; 596#L551-4 assume true; 597#L550-1 [2018-10-27 06:08:22,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:22,858 INFO L82 PathProgramCache]: Analyzing trace with hash 180428657, now seen corresponding path program 1 times [2018-10-27 06:08:22,858 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:22,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:22,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:22,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:22,882 INFO L82 PathProgramCache]: Analyzing trace with hash 62061750, now seen corresponding path program 1 times [2018-10-27 06:08:22,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:22,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:22,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:22,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:22,894 INFO L82 PathProgramCache]: Analyzing trace with hash 787219270, now seen corresponding path program 1 times [2018-10-27 06:08:22,894 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:22,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:23,048 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-10-27 06:08:23,400 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2018-10-27 06:08:23,564 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-10-27 06:08:23,567 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:23,567 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:23,567 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:23,567 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:23,568 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:23,568 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:23,568 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:23,568 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:23,568 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-10-27 06:08:23,568 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:23,568 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:23,572 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:08:23,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:23,627 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:08:23,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:23,631 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:08:23,634 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:08:23,635 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:08:23,637 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:08:24,055 WARN L179 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 118 [2018-10-27 06:08:24,117 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:08:24,119 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:08:24,121 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:08:24,124 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:08:24,126 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:08:24,130 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:08:24,133 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:08:24,732 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:24,732 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:24,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:24,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:24,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:24,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,740 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:08:24,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,749 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:24,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:24,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:24,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,764 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:08:24,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:24,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:24,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:24,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,770 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:08:24,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:24,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:24,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:24,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,782 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:08:24,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,783 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:24,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,784 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:24,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,796 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:24,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,798 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:24,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,809 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:08:24,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,816 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,817 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:08:24,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,838 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,838 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:08:24,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,851 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,852 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:08:24,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,905 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:24,949 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-10-27 06:08:24,951 INFO L444 ModelExtractionUtils]: 32 out of 43 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-10-27 06:08:24,952 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:24,953 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:24,953 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:24,953 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-10-27 06:08:25,343 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-10-27 06:08:25,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:25,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:25,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:25,497 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:08:25,498 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:08:25,498 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 98 transitions. cyclomatic complexity: 27 Second operand 4 states. [2018-10-27 06:08:25,524 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 98 transitions. cyclomatic complexity: 27. Second operand 4 states. Result 202 states and 245 transitions. Complement of second has 7 states. [2018-10-27 06:08:25,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-10-27 06:08:25,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 8 letters. Loop has 5 letters. [2018-10-27 06:08:25,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:25,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 13 letters. Loop has 5 letters. [2018-10-27 06:08:25,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:25,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 8 letters. Loop has 10 letters. [2018-10-27 06:08:25,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:25,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 245 transitions. [2018-10-27 06:08:25,530 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:08:25,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 134 states and 167 transitions. [2018-10-27 06:08:25,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-10-27 06:08:25,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-10-27 06:08:25,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 167 transitions. [2018-10-27 06:08:25,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:25,534 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2018-10-27 06:08:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 167 transitions. [2018-10-27 06:08:25,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2018-10-27 06:08:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-27 06:08:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2018-10-27 06:08:25,542 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 120 transitions. [2018-10-27 06:08:25,542 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 120 transitions. [2018-10-27 06:08:25,542 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:08:25,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 120 transitions. [2018-10-27 06:08:25,543 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:08:25,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:25,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:25,544 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:25,544 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:25,544 INFO L793 eck$LassoCheckResult]: Stem: 1019#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1018#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 1011#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1012#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 995#L570-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 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~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 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~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 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~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 996#L547-3 assume true; 1015#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1074#L551-4 assume true; 1069#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 1071#L551 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L551 1076#L551-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L551-1 1075#L551-2 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 1072#L551-4 assume true; 1059#L550-1 assume !(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 1045#L550-3 assume !(diff_~found~0 == 0); 1043#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 1041#L547-3 assume true; 1007#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1008#L551-4 [2018-10-27 06:08:25,544 INFO L795 eck$LassoCheckResult]: Loop: 1008#L551-4 assume true; 1028#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 1029#L551 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L551 1024#L551-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L551-1 1025#L551-2 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 1008#L551-4 [2018-10-27 06:08:25,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:25,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1924074049, now seen corresponding path program 2 times [2018-10-27 06:08:25,545 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:25,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:25,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:25,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:25,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:25,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:25,576 INFO L82 PathProgramCache]: Analyzing trace with hash 56489728, now seen corresponding path program 2 times [2018-10-27 06:08:25,576 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:25,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:25,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:25,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:25,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:25,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:25,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1673221312, now seen corresponding path program 3 times [2018-10-27 06:08:25,586 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:25,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:25,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:25,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:25,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:25,736 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 06:08:26,226 WARN L179 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 146 [2018-10-27 06:08:26,398 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-10-27 06:08:26,400 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:26,400 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:26,400 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:26,400 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:26,400 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:26,401 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:26,401 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:26,401 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:26,401 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-10-27 06:08:26,401 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:26,401 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:26,404 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:08:26,869 WARN L179 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 126 [2018-10-27 06:08:26,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:26,944 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:08:26,946 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:08:26,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:26,952 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:08:26,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:26,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:26,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:26,965 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:08:26,966 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:08:26,968 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:08:26,995 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:08:27,031 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:08:27,033 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:08:27,230 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-10-27 06:08:27,532 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-10-27 06:08:27,723 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:27,723 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:27,723 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:08:27,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:27,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,746 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:08:27,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,779 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:08:27,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,779 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:27,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,781 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:27,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,791 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,791 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:08:27,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:27,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,802 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:27,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,803 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:27,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,810 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:27,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:27,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,814 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:27,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,824 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:27,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,829 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,830 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:08:27,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,835 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,835 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:08:27,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,838 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,846 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:08:27,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,860 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,860 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:08:27,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,866 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:27,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,869 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,869 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:08:27,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,871 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,872 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:08:27,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,873 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,874 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:08:27,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,880 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:27,883 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:08:27,883 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:27,883 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:27,884 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:27,884 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:27,884 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~found~0) = -2*ULTIMATE.start_diff_~found~0 + 1 Supporting invariants [] [2018-10-27 06:08:28,427 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2018-10-27 06:08:28,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:28,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:28,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:28,919 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:08:28,919 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:08:28,920 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35 Second operand 4 states. [2018-10-27 06:08:29,041 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 175 states and 224 transitions. Complement of second has 7 states. [2018-10-27 06:08:29,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-10-27 06:08:29,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 18 letters. Loop has 5 letters. [2018-10-27 06:08:29,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:29,043 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:29,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:29,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:29,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:29,123 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:08:29,123 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:08:29,123 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35 Second operand 4 states. [2018-10-27 06:08:29,230 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 175 states and 224 transitions. Complement of second has 7 states. [2018-10-27 06:08:29,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:29,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-10-27 06:08:29,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 18 letters. Loop has 5 letters. [2018-10-27 06:08:29,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:29,231 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:29,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:29,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:29,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:29,303 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:08:29,303 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:08:29,303 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35 Second operand 4 states. [2018-10-27 06:08:29,340 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 120 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 222 states and 279 transitions. Complement of second has 11 states. [2018-10-27 06:08:29,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-10-27 06:08:29,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 18 letters. Loop has 5 letters. [2018-10-27 06:08:29,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:29,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 23 letters. Loop has 5 letters. [2018-10-27 06:08:29,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:29,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 18 letters. Loop has 10 letters. [2018-10-27 06:08:29,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:29,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 279 transitions. [2018-10-27 06:08:29,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:08:29,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 142 states and 178 transitions. [2018-10-27 06:08:29,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-10-27 06:08:29,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-10-27 06:08:29,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 178 transitions. [2018-10-27 06:08:29,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:29,354 INFO L705 BuchiCegarLoop]: Abstraction has 142 states and 178 transitions. [2018-10-27 06:08:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 178 transitions. [2018-10-27 06:08:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 77. [2018-10-27 06:08:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-27 06:08:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2018-10-27 06:08:29,364 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 100 transitions. [2018-10-27 06:08:29,364 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 100 transitions. [2018-10-27 06:08:29,364 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:08:29,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 100 transitions. [2018-10-27 06:08:29,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:08:29,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:29,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:29,369 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:29,369 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:29,369 INFO L793 eck$LassoCheckResult]: Stem: 2025#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2024#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 2016#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 2017#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 2001#L570-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 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~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Blen~0 * 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~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~Alen~0 * 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~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;assume { :begin_inline_diff } true;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 2002#L547-3 assume true; 2021#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 2068#L551-4 assume true; 2071#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 2063#L551 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L551 2061#L551-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L551-1 2059#L551-2 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 2056#L551-4 assume true; 2035#L550-1 assume !(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 2033#L550-3 assume !(diff_~found~0 == 0); 2034#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := diff_#t~post7 + 1;havoc diff_#t~post7; 2075#L547-3 assume true; 2076#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 2077#L551-4 assume true; 2006#L550-1 [2018-10-27 06:08:29,369 INFO L795 eck$LassoCheckResult]: Loop: 2006#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && diff_~found~0 == 0); 2026#L551 SUMMARY for call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + diff_~i~0 * 4, 4); srcloc: L551 2027#L551-1 SUMMARY for call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + diff_~j~0 * 4, 4); srcloc: L551-1 2030#L551-2 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := diff_#t~post4 + 1;havoc diff_#t~post4; 2005#L551-4 assume true; 2006#L550-1 [2018-10-27 06:08:29,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:29,370 INFO L82 PathProgramCache]: Analyzing trace with hash -483246596, now seen corresponding path program 4 times [2018-10-27 06:08:29,370 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:29,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:29,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:29,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:29,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:29,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:29,398 INFO L82 PathProgramCache]: Analyzing trace with hash 62061750, now seen corresponding path program 2 times [2018-10-27 06:08:29,398 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:29,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:29,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:29,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:29,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:29,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:29,407 INFO L82 PathProgramCache]: Analyzing trace with hash 330253211, now seen corresponding path program 1 times [2018-10-27 06:08:29,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:29,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:29,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:29,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:29,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:29,963 WARN L179 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 146 [2018-10-27 06:08:30,127 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-10-27 06:08:30,129 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:30,129 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:30,129 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:30,129 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:30,129 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:30,129 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:30,130 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:30,130 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:30,130 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration8_Lasso [2018-10-27 06:08:30,130 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:30,130 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:30,133 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:08:30,137 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:08:30,138 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:08:30,140 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:08:30,580 WARN L179 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 124 [2018-10-27 06:08:30,644 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:08:30,646 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:08:30,647 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:08:30,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:30,652 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:08:30,653 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:08:30,656 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:08:30,658 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:08:30,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:08:30,691 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:08:30,693 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:08:30,919 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-10-27 06:08:31,235 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-10-27 06:08:31,360 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:31,360 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:31,361 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:08:31,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:31,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:31,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:31,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:31,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:31,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:31,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:31,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:31,367 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:08:31,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:31,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:31,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:31,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:31,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:31,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:31,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:31,369 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:31,369 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:08:31,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:31,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:31,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:31,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:31,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:31,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:31,378 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:31,378 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:08:31,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:31,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:31,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:31,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:31,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:31,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:31,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:31,389 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:08:31,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:31,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:31,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:31,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:31,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:31,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:31,396 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:31,397 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:08:31,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:31,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:31,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:31,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:31,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:31,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:31,409 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:31,409 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:08:31,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:31,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:31,410 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:31,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:31,417 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-10-27 06:08:31,417 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:08:31,427 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:31,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:08:31,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:31,428 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:31,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:31,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:31,429 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:31,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:31,439 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:31,440 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:08:31,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:31,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:31,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:31,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:31,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:31,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:31,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:31,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:31,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:08:31,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:31,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:31,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:31,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:31,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:31,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:31,500 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:31,541 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:08:31,542 INFO L444 ModelExtractionUtils]: 81 out of 88 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:08:31,542 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:31,544 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:31,545 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:31,545 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-10-27 06:08:31,693 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2018-10-27 06:08:31,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:31,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:31,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:31,741 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:08:31,741 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:08:31,741 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30 Second operand 4 states. [2018-10-27 06:08:31,758 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30. Second operand 4 states. Result 172 states and 208 transitions. Complement of second has 7 states. [2018-10-27 06:08:31,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-10-27 06:08:31,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 19 letters. Loop has 5 letters. [2018-10-27 06:08:31,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:31,760 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:31,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:31,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:31,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:31,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:08:31,816 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:08:31,817 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30 Second operand 4 states. [2018-10-27 06:08:31,847 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30. Second operand 4 states. Result 169 states and 204 transitions. Complement of second has 9 states. [2018-10-27 06:08:31,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-10-27 06:08:31,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 19 letters. Loop has 5 letters. [2018-10-27 06:08:31,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:31,851 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:31,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:31,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:31,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:31,907 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:08:31,907 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30 Second operand 4 states. [2018-10-27 06:08:31,954 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 100 transitions. cyclomatic complexity: 30. Second operand 4 states. Result 201 states and 248 transitions. Complement of second has 13 states. [2018-10-27 06:08:31,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2018-10-27 06:08:31,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 19 letters. Loop has 5 letters. [2018-10-27 06:08:31,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:31,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 24 letters. Loop has 5 letters. [2018-10-27 06:08:31,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:31,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 19 letters. Loop has 10 letters. [2018-10-27 06:08:31,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:31,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 248 transitions. [2018-10-27 06:08:31,968 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:31,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 0 states and 0 transitions. [2018-10-27 06:08:31,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:08:31,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:08:31,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:08:31,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:31,968 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:31,968 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:31,969 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:31,969 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:08:31,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:08:31,969 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:31,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:08:31,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:08:31 BoogieIcfgContainer [2018-10-27 06:08:31,982 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:08:31,983 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:08:31,983 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:08:31,983 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:08:31,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:16" (3/4) ... [2018-10-27 06:08:31,991 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:08:31,991 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:08:31,992 INFO L168 Benchmark]: Toolchain (without parser) took 16658.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 289.9 MB). Free memory was 957.6 MB in the beginning and 996.6 MB in the end (delta: -38.9 MB). Peak memory consumption was 251.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:31,993 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:31,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.65 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:31,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -204.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:31,997 INFO L168 Benchmark]: Boogie Preprocessor took 48.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:31,998 INFO L168 Benchmark]: RCFGBuilder took 483.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:31,998 INFO L168 Benchmark]: BuchiAutomizer took 15581.44 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.1 GB in the beginning and 996.6 MB in the end (delta: 116.4 MB). Peak memory consumption was 263.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:32,001 INFO L168 Benchmark]: Witness Printer took 8.77 ms. Allocated memory is still 1.3 GB. Free memory was 996.6 MB in the beginning and 996.6 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-10-27 06:08:32,004 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 408.65 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 123.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -204.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 483.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15581.44 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.1 GB in the beginning and 996.6 MB in the end (delta: 116.4 MB). Peak memory consumption was 263.8 MB. Max. memory is 11.5 GB. * Witness Printer took 8.77 ms. Allocated memory is still 1.3 GB. Free memory was 996.6 MB in the beginning and 996.6 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * i + l1 and consists of 4 locations. One deterministic module has affine ranking function -2 * found + 1 and consists of 4 locations. One deterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function -2 * found + 1 and consists of 4 locations. One nondeterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.5s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 13.3s. Construction of modules took 0.4s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 125 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 94 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 302 SDtfs, 388 SDslu, 171 SDs, 0 SdLazy, 141 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital279 mio100 ax100 hnf98 lsp88 ukn107 mio100 lsp47 div100 bol100 ite100 ukn100 eq190 hnf89 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...