./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b0c9b6d0-9493-47cb-9be8-699497256ccc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b0c9b6d0-9493-47cb-9be8-699497256ccc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b0c9b6d0-9493-47cb-9be8-699497256ccc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b0c9b6d0-9493-47cb-9be8-699497256ccc/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_b0c9b6d0-9493-47cb-9be8-699497256ccc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b0c9b6d0-9493-47cb-9be8-699497256ccc/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-5842f4b [2018-11-18 12:16:51,677 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:16:51,678 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:16:51,684 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:16:51,685 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:16:51,685 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:16:51,686 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:16:51,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:16:51,688 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:16:51,689 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:16:51,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:16:51,690 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:16:51,690 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:16:51,691 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:16:51,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:16:51,692 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:16:51,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:16:51,693 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:16:51,695 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:16:51,696 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:16:51,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:16:51,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:16:51,698 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:16:51,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:16:51,698 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:16:51,699 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:16:51,699 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:16:51,700 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:16:51,700 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:16:51,701 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:16:51,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:16:51,702 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:16:51,702 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:16:51,702 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:16:51,703 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:16:51,703 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:16:51,704 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b0c9b6d0-9493-47cb-9be8-699497256ccc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 12:16:51,712 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:16:51,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:16:51,713 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:16:51,713 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:16:51,713 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:16:51,714 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:16:51,714 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:16:51,714 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:16:51,714 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:16:51,714 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:16:51,714 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:16:51,714 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:16:51,714 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:16:51,715 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:16:51,715 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:16:51,715 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:16:51,715 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:16:51,715 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:16:51,715 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:16:51,715 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:16:51,715 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:16:51,716 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:16:51,716 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:16:51,716 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:16:51,716 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:16:51,716 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:16:51,716 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:16:51,716 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:16:51,717 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:16:51,717 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:16:51,717 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:16:51,717 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:16:51,718 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_b0c9b6d0-9493-47cb-9be8-699497256ccc/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-11-18 12:16:51,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:16:51,752 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:16:51,754 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:16:51,755 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:16:51,756 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:16:51,756 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b0c9b6d0-9493-47cb-9be8-699497256ccc/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-11-18 12:16:51,800 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b0c9b6d0-9493-47cb-9be8-699497256ccc/bin-2019/uautomizer/data/a2bf96281/c2ab416a84e4418287204265b2773ee9/FLAG407542a96 [2018-11-18 12:16:52,121 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:16:52,122 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b0c9b6d0-9493-47cb-9be8-699497256ccc/sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-11-18 12:16:52,130 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b0c9b6d0-9493-47cb-9be8-699497256ccc/bin-2019/uautomizer/data/a2bf96281/c2ab416a84e4418287204265b2773ee9/FLAG407542a96 [2018-11-18 12:16:52,528 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b0c9b6d0-9493-47cb-9be8-699497256ccc/bin-2019/uautomizer/data/a2bf96281/c2ab416a84e4418287204265b2773ee9 [2018-11-18 12:16:52,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:16:52,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:16:52,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:16:52,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:16:52,535 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:16:52,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:16:52" (1/1) ... [2018-11-18 12:16:52,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209e89ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:16:52, skipping insertion in model container [2018-11-18 12:16:52,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:16:52" (1/1) ... [2018-11-18 12:16:52,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:16:52,570 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:16:52,745 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:16:52,752 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:16:52,780 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:16:52,853 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:16:52,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:16:52 WrapperNode [2018-11-18 12:16:52,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:16:52,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:16:52,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:16:52,854 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:16:52,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:16:52" (1/1) ... [2018-11-18 12:16:52,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:16:52" (1/1) ... [2018-11-18 12:16:52,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:16:52,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:16:52,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:16:52,881 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:16:52,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:16:52" (1/1) ... [2018-11-18 12:16:52,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:16:52" (1/1) ... [2018-11-18 12:16:52,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:16:52" (1/1) ... [2018-11-18 12:16:52,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:16:52" (1/1) ... [2018-11-18 12:16:52,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:16:52" (1/1) ... [2018-11-18 12:16:52,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:16:52" (1/1) ... [2018-11-18 12:16:52,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:16:52" (1/1) ... [2018-11-18 12:16:52,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:16:52,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:16:52,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:16:52,896 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:16:52,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:16:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0c9b6d0-9493-47cb-9be8-699497256ccc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:16:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:16:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:16:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:16:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:16:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:16:52,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:16:53,130 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:16:53,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:16:53 BoogieIcfgContainer [2018-11-18 12:16:53,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:16:53,132 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:16:53,132 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:16:53,136 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:16:53,136 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:16:53,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:16:52" (1/3) ... [2018-11-18 12:16:53,137 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c15faf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:16:53, skipping insertion in model container [2018-11-18 12:16:53,138 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:16:53,138 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:16:52" (2/3) ... [2018-11-18 12:16:53,138 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c15faf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:16:53, skipping insertion in model container [2018-11-18 12:16:53,138 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:16:53,138 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:16:53" (3/3) ... [2018-11-18 12:16:53,140 INFO L375 chiAutomizerObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2018-11-18 12:16:53,188 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:16:53,188 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:16:53,188 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:16:53,188 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:16:53,189 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:16:53,189 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:16:53,189 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:16:53,189 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:16:53,189 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:16:53,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 12:16:53,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:16:53,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:16:53,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:16:53,225 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 12:16:53,225 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:16:53,225 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:16:53,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 12:16:53,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:16:53,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:16:53,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:16:53,227 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 12:16:53,227 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:16:53,233 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~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; 6#L567true assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 10#L567-2true assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 3#L570-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);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; 9#L547-3true [2018-11-18 12:16:53,233 INFO L796 eck$LassoCheckResult]: Loop: 9#L547-3true assume true; 5#L547-1true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 17#L551-2true assume !true; 4#L550-3true assume !(0 == diff_~found~0); 7#L557-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 9#L547-3true [2018-11-18 12:16:53,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:53,237 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-18 12:16:53,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:53,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:53,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:53,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:53,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:53,325 INFO L82 PathProgramCache]: Analyzing trace with hash 46963718, now seen corresponding path program 1 times [2018-11-18 12:16:53,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:53,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:53,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:53,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:53,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:53,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:16:53,351 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:16:53,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 12:16:53,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:16:53,362 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 2 states. [2018-11-18 12:16:53,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:53,368 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2018-11-18 12:16:53,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 12:16:53,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2018-11-18 12:16:53,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:16:53,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 17 transitions. [2018-11-18 12:16:53,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 12:16:53,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 12:16:53,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2018-11-18 12:16:53,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:16:53,374 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-18 12:16:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2018-11-18 12:16:53,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 12:16:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 12:16:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-11-18 12:16:53,390 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-18 12:16:53,391 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-18 12:16:53,391 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:16:53,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2018-11-18 12:16:53,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 12:16:53,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:16:53,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:16:53,392 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 12:16:53,392 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:16:53,392 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 40#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; 41#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 50#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 42#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);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; 43#L547-3 [2018-11-18 12:16:53,392 INFO L796 eck$LassoCheckResult]: Loop: 43#L547-3 assume true; 47#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 48#L551-2 assume true; 51#L550-1 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 44#L550-3 assume !(0 == diff_~found~0); 45#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 43#L547-3 [2018-11-18 12:16:53,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:53,393 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-18 12:16:53,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:53,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:53,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:53,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:53,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:53,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1455442797, now seen corresponding path program 1 times [2018-11-18 12:16:53,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:53,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:53,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:16:53,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:53,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:53,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:16:53,441 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:16:53,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:16:53,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:16:53,442 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-18 12:16:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:53,467 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2018-11-18 12:16:53,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:16:53,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2018-11-18 12:16:53,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-18 12:16:53,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 24 transitions. [2018-11-18 12:16:53,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-18 12:16:53,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 12:16:53,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2018-11-18 12:16:53,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:16:53,470 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-18 12:16:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2018-11-18 12:16:53,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-11-18 12:16:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 12:16:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-11-18 12:16:53,471 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-18 12:16:53,471 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-18 12:16:53,472 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:16:53,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-11-18 12:16:53,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 12:16:53,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:16:53,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:16:53,473 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 12:16:53,473 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:16:53,473 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 76#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; 77#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 87#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 78#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);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; 79#L547-3 [2018-11-18 12:16:53,473 INFO L796 eck$LassoCheckResult]: Loop: 79#L547-3 assume true; 83#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 84#L551-2 assume true; 90#L550-1 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 80#L550-3 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 81#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 79#L547-3 [2018-11-18 12:16:53,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:53,473 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2018-11-18 12:16:53,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:53,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:53,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:53,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:53,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:53,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1455442735, now seen corresponding path program 1 times [2018-11-18 12:16:53,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:53,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:53,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:16:53,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:53,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:53,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2146066612, now seen corresponding path program 1 times [2018-11-18 12:16:53,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:53,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:53,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:53,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:53,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:16:53,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:16:53,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:16:53,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:16:53,663 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-18 12:16:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:53,690 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2018-11-18 12:16:53,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:16:53,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2018-11-18 12:16:53,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-18 12:16:53,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2018-11-18 12:16:53,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-18 12:16:53,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 12:16:53,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-18 12:16:53,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:16:53,692 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-18 12:16:53,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-18 12:16:53,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-18 12:16:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 12:16:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-18 12:16:53,694 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-18 12:16:53,694 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-18 12:16:53,694 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:16:53,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-18 12:16:53,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-18 12:16:53,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:16:53,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:16:53,695 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 12:16:53,696 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:53,696 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 123#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; 124#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 132#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 125#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);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; 126#L547-3 [2018-11-18 12:16:53,696 INFO L796 eck$LassoCheckResult]: Loop: 126#L547-3 assume true; 130#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 131#L551-2 assume true; 136#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 133#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 134#L551-2 assume true; 138#L550-1 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 137#L550-3 assume !(0 == diff_~found~0); 129#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 126#L547-3 [2018-11-18 12:16:53,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:53,696 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2018-11-18 12:16:53,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:53,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:53,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:53,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:53,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:53,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1447989759, now seen corresponding path program 1 times [2018-11-18 12:16:53,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:53,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:53,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:16:53,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:53,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:53,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1364405670, now seen corresponding path program 1 times [2018-11-18 12:16:53,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:53,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:53,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:53,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:53,979 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-18 12:16:54,102 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-11-18 12:16:54,110 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:16:54,110 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:16:54,110 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:16:54,110 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:16:54,111 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:16:54,111 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:16:54,111 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:16:54,111 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:16:54,111 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-18 12:16:54,111 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:16:54,111 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:16:54,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-11-18 12:16:54,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:54,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-11-18 12:16:54,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-11-18 12:16:54,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:54,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:54,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-11-18 12:16:54,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-11-18 12:16:54,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:54,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:54,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-11-18 12:16:54,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:54,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-11-18 12:16:54,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:54,369 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2018-11-18 12:16:54,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:54,767 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:16:54,771 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:16:54,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:54,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:54,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:54,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,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-11-18 12:16:54,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:54,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:54,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:54,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,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-11-18 12:16:54,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:54,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:54,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:54,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:54,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:54,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:54,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:54,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:54,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:54,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:54,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:54,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:54,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:54,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:54,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:54,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:54,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:54,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:54,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,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-11-18 12:16:54,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:54,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:54,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:54,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:54,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:54,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:54,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,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-11-18 12:16:54,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:54,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:54,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:54,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:54,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:54,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:54,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,821 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:16:54,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,823 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:16:54,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:54,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,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-11-18 12:16:54,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:54,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:54,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,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-11-18 12:16:54,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:54,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:54,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:54,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:54,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,853 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:16:54,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,855 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:16:54,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:54,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:54,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:54,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:54,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:54,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,892 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:16:54,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,893 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:16:54,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:54,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:54,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:54,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:54,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:54,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:54,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:54,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:54,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:54,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:54,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:54,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:54,923 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:16:54,958 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-18 12:16:54,958 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 12:16:54,960 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:16:54,961 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:16:54,961 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:16:54,961 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~A.offset, v_rep(select #length ULTIMATE.start_diff_~A.base)_1) = -4*ULTIMATE.start_diff_~i~0 - 1*ULTIMATE.start_diff_~A.offset + 1*v_rep(select #length ULTIMATE.start_diff_~A.base)_1 Supporting invariants [] [2018-11-18 12:16:55,027 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-18 12:16:55,034 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 12:16:55,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:55,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:55,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:55,105 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-11-18 12:16:55,106 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 12:16:55,141 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 29 states and 40 transitions. Complement of second has 6 states. [2018-11-18 12:16:55,142 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-11-18 12:16:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:16:55,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-18 12:16:55,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 9 letters. [2018-11-18 12:16:55,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:16:55,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 9 letters. [2018-11-18 12:16:55,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:16:55,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-18 12:16:55,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:16:55,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2018-11-18 12:16:55,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 12:16:55,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2018-11-18 12:16:55,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 12:16:55,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 12:16:55,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2018-11-18 12:16:55,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:16:55,152 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-18 12:16:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2018-11-18 12:16:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-11-18 12:16:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 12:16:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-11-18 12:16:55,153 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-18 12:16:55,154 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-18 12:16:55,154 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:16:55,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2018-11-18 12:16:55,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:16:55,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:16:55,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:16:55,155 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:55,155 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:16:55,155 INFO L794 eck$LassoCheckResult]: Stem: 300#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 294#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; 295#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 305#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 296#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);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; 297#L547-3 assume true; 301#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 302#L551-2 [2018-11-18 12:16:55,155 INFO L796 eck$LassoCheckResult]: Loop: 302#L551-2 assume true; 311#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 306#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 302#L551-2 [2018-11-18 12:16:55,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:55,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935596, now seen corresponding path program 1 times [2018-11-18 12:16:55,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:55,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:55,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:55,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:55,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:55,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:55,167 INFO L82 PathProgramCache]: Analyzing trace with hash 58783, now seen corresponding path program 1 times [2018-11-18 12:16:55,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:55,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:55,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:55,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:55,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:55,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:55,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1593248660, now seen corresponding path program 1 times [2018-11-18 12:16:55,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:55,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:55,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:55,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:55,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:55,443 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 113 [2018-11-18 12:16:55,548 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-11-18 12:16:55,549 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:16:55,549 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:16:55,550 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:16:55,550 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:16:55,550 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:16:55,550 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:16:55,550 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:16:55,550 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:16:55,550 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-18 12:16:55,550 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:16:55,550 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:16:55,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:55,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:55,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:55,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:55,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:55,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-11-18 12:16:55,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:55,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:55,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:55,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:55,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:55,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:55,757 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2018-11-18 12:16:55,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-11-18 12:16:55,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:55,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:56,124 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:16:56,124 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:16:56,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:56,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:56,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:56,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:56,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:56,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:56,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:56,129 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:16:56,131 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:16:56,131 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 12:16:56,131 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:16:56,132 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:16:56,132 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:16:56,132 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~found~0) = -2*ULTIMATE.start_diff_~found~0 + 1 Supporting invariants [] [2018-11-18 12:16:56,172 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-18 12:16:56,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:56,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:56,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:56,223 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-11-18 12:16:56,223 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-18 12:16:56,262 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 70 states and 93 transitions. Complement of second has 7 states. [2018-11-18 12:16:56,264 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-11-18 12:16:56,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:16:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-18 12:16:56,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-18 12:16:56,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:16:56,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-18 12:16:56,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:16:56,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-18 12:16:56,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:16:56,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 93 transitions. [2018-11-18 12:16:56,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 12:16:56,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 66 states and 89 transitions. [2018-11-18 12:16:56,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-18 12:16:56,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-18 12:16:56,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 89 transitions. [2018-11-18 12:16:56,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:16:56,270 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 89 transitions. [2018-11-18 12:16:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 89 transitions. [2018-11-18 12:16:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-11-18 12:16:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 12:16:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2018-11-18 12:16:56,277 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 77 transitions. [2018-11-18 12:16:56,277 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 77 transitions. [2018-11-18 12:16:56,277 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:16:56,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 77 transitions. [2018-11-18 12:16:56,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 12:16:56,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:16:56,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:16:56,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:56,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:16:56,279 INFO L794 eck$LassoCheckResult]: Stem: 509#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 505#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; 506#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 516#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 507#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);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; 508#L547-3 assume true; 523#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 535#L551-2 assume true; 526#L550-1 [2018-11-18 12:16:56,279 INFO L796 eck$LassoCheckResult]: Loop: 526#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 517#L551 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 518#L551-2 assume true; 526#L550-1 [2018-11-18 12:16:56,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:56,279 INFO L82 PathProgramCache]: Analyzing trace with hash 180428657, now seen corresponding path program 1 times [2018-11-18 12:16:56,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:56,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:56,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:56,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:56,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:56,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:56,288 INFO L82 PathProgramCache]: Analyzing trace with hash 64695, now seen corresponding path program 1 times [2018-11-18 12:16:56,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:56,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:56,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:56,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:56,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:56,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:56,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2146068295, now seen corresponding path program 1 times [2018-11-18 12:16:56,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:56,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:56,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:56,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:56,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:56,573 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2018-11-18 12:16:56,670 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:16:56,670 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:16:56,670 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:16:56,670 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:16:56,670 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:16:56,670 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:16:56,670 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:16:56,670 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:16:56,670 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-18 12:16:56,670 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:16:56,670 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:16:56,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:56,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:56,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:56,866 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2018-11-18 12:16:56,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:56,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:56,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:56,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:56,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:56,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:56,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:56,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:56,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:56,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:56,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:56,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:57,270 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:16:57,271 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:16:57,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:57,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:57,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:57,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:57,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:57,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:57,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:57,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:57,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:57,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:57,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:57,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:57,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:57,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:57,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:57,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:57,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:57,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:57,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:57,275 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:16:57,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:57,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:57,276 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:16:57,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:57,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:57,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:57,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:57,281 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:16:57,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:57,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:57,282 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:16:57,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:57,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:57,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:57,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:57,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:57,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:57,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:57,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:57,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:57,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:57,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:57,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:57,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:57,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:57,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:57,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:57,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:57,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:57,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:57,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:57,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:57,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:57,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:57,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:57,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:57,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:57,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:57,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:57,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:57,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:57,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:57,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:57,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:57,332 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:16:57,347 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:16:57,347 INFO L444 ModelExtractionUtils]: 69 out of 73 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:16:57,347 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:16:57,349 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:16:57,349 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:16:57,349 INFO L520 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-11-18 12:16:57,390 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-18 12:16:57,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:57,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:57,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:57,439 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-11-18 12:16:57,439 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 77 transitions. cyclomatic complexity: 27 Second operand 4 states. [2018-11-18 12:16:57,481 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 77 transitions. cyclomatic complexity: 27. Second operand 4 states. Result 141 states and 183 transitions. Complement of second has 7 states. [2018-11-18 12:16:57,483 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-11-18 12:16:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:16:57,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-18 12:16:57,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 12:16:57,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:16:57,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 12:16:57,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:16:57,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 12:16:57,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:16:57,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 183 transitions. [2018-11-18 12:16:57,486 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 12:16:57,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 95 states and 128 transitions. [2018-11-18 12:16:57,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 12:16:57,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 12:16:57,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 128 transitions. [2018-11-18 12:16:57,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:16:57,487 INFO L705 BuchiCegarLoop]: Abstraction has 95 states and 128 transitions. [2018-11-18 12:16:57,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 128 transitions. [2018-11-18 12:16:57,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 67. [2018-11-18 12:16:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 12:16:57,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2018-11-18 12:16:57,493 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 93 transitions. [2018-11-18 12:16:57,493 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 93 transitions. [2018-11-18 12:16:57,493 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 12:16:57,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 93 transitions. [2018-11-18 12:16:57,494 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 12:16:57,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:16:57,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:16:57,495 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:57,495 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:16:57,495 INFO L794 eck$LassoCheckResult]: Stem: 824#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 820#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; 821#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 835#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 822#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);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; 823#L547-3 assume true; 838#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 880#L551-2 assume true; 842#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 882#L551 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 881#L551-2 assume true; 846#L550-1 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 847#L550-3 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 836#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 837#L547-3 assume true; 839#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 832#L551-2 [2018-11-18 12:16:57,495 INFO L796 eck$LassoCheckResult]: Loop: 832#L551-2 assume true; 840#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 831#L551 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 832#L551-2 [2018-11-18 12:16:57,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:57,495 INFO L82 PathProgramCache]: Analyzing trace with hash 546124804, now seen corresponding path program 1 times [2018-11-18 12:16:57,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:57,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:57,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:57,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:57,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:57,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:57,517 INFO L82 PathProgramCache]: Analyzing trace with hash 58785, now seen corresponding path program 2 times [2018-11-18 12:16:57,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:57,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:57,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:57,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:57,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:57,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:57,524 INFO L82 PathProgramCache]: Analyzing trace with hash 267947710, now seen corresponding path program 2 times [2018-11-18 12:16:57,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:57,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:57,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:57,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:16:57,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:57,933 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 148 [2018-11-18 12:16:58,034 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:16:58,034 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:16:58,034 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:16:58,035 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:16:58,035 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:16:58,035 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:16:58,035 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:16:58,035 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:16:58,035 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-11-18 12:16:58,035 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:16:58,035 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:16:58,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:58,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:58,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:58,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:58,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:58,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:58,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:58,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:58,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:58,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:58,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:58,286 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2018-11-18 12:16:58,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:58,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:58,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:58,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:58,536 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-11-18 12:16:58,746 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:16:58,746 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:16:58,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-11-18 12:16:58,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:58,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:58,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:58,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:58,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:58,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:58,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:58,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:58,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:58,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:58,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:58,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:58,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:58,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:58,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:58,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:58,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:58,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:58,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:58,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:58,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:58,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:58,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:58,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:58,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:58,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-11-18 12:16:58,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:58,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:58,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:58,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:58,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:58,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:58,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:58,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:58,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:58,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:58,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:58,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:58,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:58,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:58,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:58,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:58,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:58,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:58,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:58,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:58,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:58,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:58,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:58,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:58,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:58,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:58,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:58,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:58,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:58,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:58,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:58,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:58,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:58,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:58,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:58,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:58,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:58,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:58,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:58,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:58,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:58,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:58,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:58,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:58,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:16:58,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:58,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:58,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:58,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:16:58,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:16:58,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:58,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:58,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:58,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:58,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:58,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:58,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:58,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:58,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:58,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:58,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:58,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:58,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:58,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:58,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:58,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:58,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:58,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:58,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:58,774 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:16:58,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:58,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:58,775 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:16:58,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:58,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:58,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-11-18 12:16:58,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:58,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:58,779 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:16:58,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:58,781 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 12:16:58,781 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 12:16:58,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:58,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:58,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:58,789 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:16:58,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:58,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:58,790 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:16:58,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:58,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:58,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:58,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:58,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:58,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:58,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:58,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:58,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:58,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:16:58,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:16:58,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:16:58,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:16:58,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:16:58,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:16:58,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:16:58,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:16:58,836 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:16:58,859 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 12:16:58,859 INFO L444 ModelExtractionUtils]: 70 out of 76 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 12:16:58,859 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:16:58,860 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:16:58,860 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:16:58,860 INFO L520 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-11-18 12:16:58,930 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-18 12:16:58,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:58,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:58,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:58,973 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-11-18 12:16:58,973 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 93 transitions. cyclomatic complexity: 35 Second operand 4 states. [2018-11-18 12:16:59,007 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 93 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 132 states and 171 transitions. Complement of second has 7 states. [2018-11-18 12:16:59,008 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-11-18 12:16:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:16:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-18 12:16:59,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-18 12:16:59,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:16:59,009 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:16:59,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:59,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:59,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:59,058 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-11-18 12:16:59,058 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 93 transitions. cyclomatic complexity: 35 Second operand 4 states. [2018-11-18 12:16:59,081 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 93 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 132 states and 171 transitions. Complement of second has 7 states. [2018-11-18 12:16:59,082 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-11-18 12:16:59,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:16:59,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-18 12:16:59,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-18 12:16:59,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:16:59,082 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:16:59,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:59,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:59,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:59,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:16:59,130 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-11-18 12:16:59,130 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 93 transitions. cyclomatic complexity: 35 Second operand 4 states. [2018-11-18 12:16:59,151 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 93 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 159 states and 213 transitions. Complement of second has 6 states. [2018-11-18 12:16:59,152 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-11-18 12:16:59,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:16:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-18 12:16:59,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-18 12:16:59,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:16:59,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-18 12:16:59,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:16:59,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 16 letters. Loop has 6 letters. [2018-11-18 12:16:59,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:16:59,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 213 transitions. [2018-11-18 12:16:59,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:16:59,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 74 states and 99 transitions. [2018-11-18 12:16:59,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 12:16:59,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 12:16:59,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 99 transitions. [2018-11-18 12:16:59,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:16:59,161 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 99 transitions. [2018-11-18 12:16:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 99 transitions. [2018-11-18 12:16:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 45. [2018-11-18 12:16:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 12:16:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2018-11-18 12:16:59,163 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2018-11-18 12:16:59,163 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2018-11-18 12:16:59,163 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 12:16:59,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 62 transitions. [2018-11-18 12:16:59,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:16:59,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:16:59,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:16:59,164 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:16:59,164 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:16:59,164 INFO L794 eck$LassoCheckResult]: Stem: 1618#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1614#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; 1615#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1630#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 1616#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);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; 1617#L547-3 assume true; 1623#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1624#L551-2 assume true; 1658#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1645#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 1657#L551-2 assume true; 1655#L550-1 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 1642#L550-3 assume !(0 == diff_~found~0); 1620#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 1639#L547-3 assume true; 1621#L547-1 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1622#L551-2 assume true; 1633#L550-1 [2018-11-18 12:16:59,165 INFO L796 eck$LassoCheckResult]: Loop: 1633#L550-1 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1625#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 1626#L551-2 assume true; 1633#L550-1 [2018-11-18 12:16:59,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:59,165 INFO L82 PathProgramCache]: Analyzing trace with hash 561193437, now seen corresponding path program 2 times [2018-11-18 12:16:59,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:59,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:59,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:59,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:16:59,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:59,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:59,178 INFO L82 PathProgramCache]: Analyzing trace with hash 64633, now seen corresponding path program 2 times [2018-11-18 12:16:59,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:59,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:59,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:59,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:16:59,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:59,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:59,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1793966819, now seen corresponding path program 3 times [2018-11-18 12:16:59,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:16:59,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:16:59,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:59,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:16:59,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:16:59,534 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 134 [2018-11-18 12:16:59,643 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-18 12:16:59,645 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:16:59,645 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:16:59,646 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:16:59,646 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:16:59,646 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:16:59,646 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:16:59,646 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:16:59,646 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:16:59,646 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration8_Lasso [2018-11-18 12:16:59,646 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:16:59,646 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:16:59,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:59,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-11-18 12:16:59,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:59,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:59,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:59,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:59,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:59,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:59,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:59,895 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 101 [2018-11-18 12:16:59,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:59,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:59,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:59,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:59,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:16:59,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:17:00,269 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:17:00,269 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:17:00,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:17:00,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:17:00,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:17:00,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:17:00,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:17:00,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:17:00,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:17:00,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:17:00,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:17:00,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:17:00,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:17:00,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:17:00,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:17:00,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:17:00,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:17:00,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:17:00,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:17:00,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:17:00,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:17:00,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:17:00,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:17:00,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:17:00,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:17:00,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:17:00,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:17:00,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:17:00,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,303 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:17:00,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,304 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:17:00,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:17:00,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:17:00,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:17:00,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,311 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:17:00,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,312 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:17:00,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:17:00,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:17:00,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:17:00,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:17:00,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:17:00,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:17:00,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:17:00,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,324 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:17:00,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,325 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:17:00,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:17:00,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:17:00,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:17:00,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:17:00,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:17:00,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:17:00,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:17:00,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:17:00,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:17:00,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:17:00,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:17:00,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:17:00,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:17:00,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:17:00,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:17:00,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:17:00,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:17:00,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:17:00,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:17:00,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:17:00,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:17:00,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:17:00,339 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:17:00,341 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:17:00,341 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:17:00,342 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:17:00,342 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:17:00,342 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:17:00,342 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~found~0) = -2*ULTIMATE.start_diff_~found~0 + 1 Supporting invariants [] [2018-11-18 12:17:00,416 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2018-11-18 12:17:00,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:00,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:17:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:00,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:17:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:17:00,466 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-11-18 12:17:00,466 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 62 transitions. cyclomatic complexity: 21 Second operand 4 states. [2018-11-18 12:17:00,490 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 62 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 76 states and 103 transitions. Complement of second has 7 states. [2018-11-18 12:17:00,492 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-11-18 12:17:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:17:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-18 12:17:00,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-18 12:17:00,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:17:00,493 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:17:00,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:00,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:17:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:00,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:17:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:17:00,533 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-11-18 12:17:00,533 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 62 transitions. cyclomatic complexity: 21 Second operand 4 states. [2018-11-18 12:17:00,559 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 62 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 74 states and 100 transitions. Complement of second has 9 states. [2018-11-18 12:17:00,559 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-11-18 12:17:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:17:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-18 12:17:00,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-18 12:17:00,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:17:00,560 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:17:00,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:00,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:17:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:00,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:17:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:17:00,603 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-11-18 12:17:00,603 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 62 transitions. cyclomatic complexity: 21 Second operand 4 states. [2018-11-18 12:17:00,624 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 62 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 118 states and 163 transitions. Complement of second has 13 states. [2018-11-18 12:17:00,625 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-11-18 12:17:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:17:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-18 12:17:00,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-18 12:17:00,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:17:00,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-18 12:17:00,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:17:00,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 17 letters. Loop has 6 letters. [2018-11-18 12:17:00,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:17:00,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 163 transitions. [2018-11-18 12:17:00,628 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:17:00,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 0 states and 0 transitions. [2018-11-18 12:17:00,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:17:00,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:17:00,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:17:00,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:17:00,628 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:17:00,628 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:17:00,628 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:17:00,628 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 12:17:00,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:17:00,629 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:17:00,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:17:00,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:17:00 BoogieIcfgContainer [2018-11-18 12:17:00,634 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:17:00,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:17:00,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:17:00,635 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:17:00,635 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:16:53" (3/4) ... [2018-11-18 12:17:00,637 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:17:00,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:17:00,638 INFO L168 Benchmark]: Toolchain (without parser) took 8107.16 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.4 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -95.1 MB). Peak memory consumption was 237.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:17:00,639 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:17:00,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:17:00,639 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.95 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:17:00,640 INFO L168 Benchmark]: Boogie Preprocessor took 14.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:17:00,640 INFO L168 Benchmark]: RCFGBuilder took 235.46 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-18 12:17:00,641 INFO L168 Benchmark]: BuchiAutomizer took 7502.55 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 67.3 MB). Peak memory consumption was 242.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:17:00,641 INFO L168 Benchmark]: Witness Printer took 3.20 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:17:00,643 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.95 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.53 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 235.46 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7502.55 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 67.3 MB). Peak memory consumption was 242.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.20 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 -4 * i + -1 * A + unknown-#length-unknown[A] 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 l2 + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function -2 * found + 1 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 7.4s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 6.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 75 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 228 SDtfs, 262 SDslu, 108 SDs, 0 SdLazy, 136 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital275 mio100 ax100 hnf98 lsp90 ukn89 mio100 lsp57 div100 bol100 ite100 ukn100 eq184 hnf89 smp97 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 2 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...