./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a4bb89dd-f1c1-436c-b2c6-372c67d5d5c1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a4bb89dd-f1c1-436c-b2c6-372c67d5d5c1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a4bb89dd-f1c1-436c-b2c6-372c67d5d5c1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a4bb89dd-f1c1-436c-b2c6-372c67d5d5c1/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_a4bb89dd-f1c1-436c-b2c6-372c67d5d5c1/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a4bb89dd-f1c1-436c-b2c6-372c67d5d5c1/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-635dfa2 [2018-12-09 01:40:07,538 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:40:07,539 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:40:07,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:40:07,545 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:40:07,546 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:40:07,547 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:40:07,548 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:40:07,549 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:40:07,550 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:40:07,550 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:40:07,550 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:40:07,551 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:40:07,552 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:40:07,552 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:40:07,553 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:40:07,554 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:40:07,555 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:40:07,556 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:40:07,557 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:40:07,558 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:40:07,559 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:40:07,560 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:40:07,560 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:40:07,560 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:40:07,561 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:40:07,562 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:40:07,562 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:40:07,563 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:40:07,563 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:40:07,563 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:40:07,564 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:40:07,564 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:40:07,564 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:40:07,565 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:40:07,565 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:40:07,565 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a4bb89dd-f1c1-436c-b2c6-372c67d5d5c1/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 01:40:07,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:40:07,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:40:07,576 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:40:07,576 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:40:07,577 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:40:07,577 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 01:40:07,577 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 01:40:07,577 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 01:40:07,577 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 01:40:07,577 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 01:40:07,577 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 01:40:07,578 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:40:07,578 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:40:07,578 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:40:07,578 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:40:07,578 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:40:07,578 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:40:07,578 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 01:40:07,578 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 01:40:07,579 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 01:40:07,579 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:40:07,579 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:40:07,579 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 01:40:07,579 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:40:07,579 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 01:40:07,579 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:40:07,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:40:07,580 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 01:40:07,580 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:40:07,580 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 01:40:07,580 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 01:40:07,581 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 01:40:07,581 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_a4bb89dd-f1c1-436c-b2c6-372c67d5d5c1/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-12-09 01:40:07,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:40:07,614 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:40:07,617 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:40:07,618 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:40:07,618 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:40:07,619 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a4bb89dd-f1c1-436c-b2c6-372c67d5d5c1/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-12-09 01:40:07,665 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a4bb89dd-f1c1-436c-b2c6-372c67d5d5c1/bin-2019/uautomizer/data/bbf6975ce/cdbba909c9b8428894072aabbd94d272/FLAG239a0b43c [2018-12-09 01:40:08,073 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:40:08,073 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a4bb89dd-f1c1-436c-b2c6-372c67d5d5c1/sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-12-09 01:40:08,079 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a4bb89dd-f1c1-436c-b2c6-372c67d5d5c1/bin-2019/uautomizer/data/bbf6975ce/cdbba909c9b8428894072aabbd94d272/FLAG239a0b43c [2018-12-09 01:40:08,087 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a4bb89dd-f1c1-436c-b2c6-372c67d5d5c1/bin-2019/uautomizer/data/bbf6975ce/cdbba909c9b8428894072aabbd94d272 [2018-12-09 01:40:08,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:40:08,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:40:08,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:40:08,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:40:08,093 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:40:08,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:40:08" (1/1) ... [2018-12-09 01:40:08,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68649384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:08, skipping insertion in model container [2018-12-09 01:40:08,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:40:08" (1/1) ... [2018-12-09 01:40:08,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:40:08,120 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:40:08,261 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:40:08,267 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:40:08,322 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:40:08,341 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:40:08,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:08 WrapperNode [2018-12-09 01:40:08,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:40:08,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:40:08,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:40:08,342 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:40:08,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:08" (1/1) ... [2018-12-09 01:40:08,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:08" (1/1) ... [2018-12-09 01:40:08,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:40:08,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:40:08,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:40:08,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:40:08,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:08" (1/1) ... [2018-12-09 01:40:08,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:08" (1/1) ... [2018-12-09 01:40:08,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:08" (1/1) ... [2018-12-09 01:40:08,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:08" (1/1) ... [2018-12-09 01:40:08,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:08" (1/1) ... [2018-12-09 01:40:08,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:08" (1/1) ... [2018-12-09 01:40:08,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:08" (1/1) ... [2018-12-09 01:40:08,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:40:08,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:40:08,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:40:08,383 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:40:08,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4bb89dd-f1c1-436c-b2c6-372c67d5d5c1/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:40:08,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:40:08,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 01:40:08,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 01:40:08,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:40:08,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:40:08,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:40:08,555 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:40:08,556 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 01:40:08,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:40:08 BoogieIcfgContainer [2018-12-09 01:40:08,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:40:08,556 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 01:40:08,556 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 01:40:08,559 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 01:40:08,560 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:40:08,560 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 01:40:08" (1/3) ... [2018-12-09 01:40:08,561 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52e48130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 01:40:08, skipping insertion in model container [2018-12-09 01:40:08,561 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:40:08,561 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:40:08" (2/3) ... [2018-12-09 01:40:08,561 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52e48130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 01:40:08, skipping insertion in model container [2018-12-09 01:40:08,561 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:40:08,561 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:40:08" (3/3) ... [2018-12-09 01:40:08,563 INFO L375 chiAutomizerObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2018-12-09 01:40:08,595 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:40:08,595 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 01:40:08,596 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 01:40:08,596 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 01:40:08,596 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:40:08,596 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:40:08,596 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 01:40:08,596 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:40:08,596 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 01:40:08,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-09 01:40:08,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 01:40:08,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:40:08,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:40:08,623 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 01:40:08,623 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 01:40:08,623 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 01:40:08,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-09 01:40:08,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 01:40:08,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:40:08,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:40:08,624 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 01:40:08,624 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 01:40:08,629 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true 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; 5#L567true assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 9#L567-2true assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 4#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;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; 7#L547-2true [2018-12-09 01:40:08,630 INFO L796 eck$LassoCheckResult]: Loop: 7#L547-2true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 16#L551-2true assume !true; 3#L550-2true 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; 6#L557-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 7#L547-2true [2018-12-09 01:40:08,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:08,634 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-09 01:40:08,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:08,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:08,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:08,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:08,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:08,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:08,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1679350, now seen corresponding path program 1 times [2018-12-09 01:40:08,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:08,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:08,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:08,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:08,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:40:08,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:40:08,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:40:08,735 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:40:08,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 01:40:08,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 01:40:08,745 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-12-09 01:40:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:40:08,749 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-12-09 01:40:08,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 01:40:08,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2018-12-09 01:40:08,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 01:40:08,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 15 transitions. [2018-12-09 01:40:08,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 01:40:08,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 01:40:08,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2018-12-09 01:40:08,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:40:08,755 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-12-09 01:40:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2018-12-09 01:40:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-09 01:40:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-09 01:40:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-12-09 01:40:08,772 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-12-09 01:40:08,772 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-12-09 01:40:08,772 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 01:40:08,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2018-12-09 01:40:08,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 01:40:08,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:40:08,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:40:08,773 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 01:40:08,773 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 01:40:08,773 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 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; 39#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 43#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 40#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;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; 41#L547-2 [2018-12-09 01:40:08,773 INFO L796 eck$LassoCheckResult]: Loop: 41#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 45#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 36#L550-2 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; 37#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 41#L547-2 [2018-12-09 01:40:08,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:08,773 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-09 01:40:08,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:08,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:08,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:08,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:08,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:08,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:08,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1669740, now seen corresponding path program 1 times [2018-12-09 01:40:08,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:08,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:08,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:08,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:40:08,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:08,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:08,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1298476337, now seen corresponding path program 1 times [2018-12-09 01:40:08,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:08,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:08,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:08,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:08,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:40:08,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:40:08,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:40:08,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:40:08,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:40:08,937 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-12-09 01:40:08,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:40:08,973 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2018-12-09 01:40:08,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:40:08,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2018-12-09 01:40:08,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 01:40:08,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2018-12-09 01:40:08,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-09 01:40:08,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-09 01:40:08,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2018-12-09 01:40:08,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:40:08,976 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-12-09 01:40:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2018-12-09 01:40:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-12-09 01:40:08,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-09 01:40:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-12-09 01:40:08,977 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-12-09 01:40:08,977 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-12-09 01:40:08,977 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 01:40:08,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2018-12-09 01:40:08,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 01:40:08,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:40:08,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:40:08,978 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 01:40:08,978 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 01:40:08,978 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#L-1 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; 75#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 81#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 76#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;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; 77#L547-2 [2018-12-09 01:40:08,978 INFO L796 eck$LassoCheckResult]: Loop: 77#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 82#L551-2 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); 79#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 80#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 72#L550-2 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; 73#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 77#L547-2 [2018-12-09 01:40:08,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:08,978 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2018-12-09 01:40:08,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:08,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:08,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:08,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:08,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:08,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:08,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183209, now seen corresponding path program 1 times [2018-12-09 01:40:08,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:08,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:08,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:08,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:40:08,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:40:09,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:40:09,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:40:09,011 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:40:09,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:40:09,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:40:09,012 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-12-09 01:40:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:40:09,033 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-12-09 01:40:09,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:40:09,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-12-09 01:40:09,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-09 01:40:09,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2018-12-09 01:40:09,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-09 01:40:09,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 01:40:09,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-12-09 01:40:09,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:40:09,035 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-09 01:40:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-12-09 01:40:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-12-09 01:40:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-09 01:40:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-12-09 01:40:09,036 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-12-09 01:40:09,036 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-12-09 01:40:09,036 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 01:40:09,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2018-12-09 01:40:09,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 01:40:09,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:40:09,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:40:09,037 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 01:40:09,037 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 01:40:09,037 INFO L794 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 109#L-1 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; 110#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 117#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 111#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;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; 112#L547-2 [2018-12-09 01:40:09,037 INFO L796 eck$LassoCheckResult]: Loop: 112#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 118#L551-2 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); 114#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 115#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 107#L550-2 assume !(0 == diff_~found~0); 108#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 112#L547-2 [2018-12-09 01:40:09,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:09,038 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2018-12-09 01:40:09,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:09,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:09,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:09,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:09,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:09,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:09,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183271, now seen corresponding path program 1 times [2018-12-09 01:40:09,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:09,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:09,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:09,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:40:09,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:09,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:09,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1998160148, now seen corresponding path program 1 times [2018-12-09 01:40:09,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:09,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:09,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:09,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:09,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:09,286 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-09 01:40:09,391 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:40:09,392 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:40:09,392 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:40:09,392 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:40:09,392 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:40:09,392 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:40:09,392 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:40:09,392 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:40:09,392 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-12-09 01:40:09,392 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:40:09,393 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:40:09,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:09,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:09,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:09,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:09,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:09,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:09,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:09,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:09,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:09,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:09,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:09,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:09,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:09,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:09,638 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2018-12-09 01:40:09,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:09,993 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:40:09,997 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 01:40:09,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:10,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:10,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:10,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:10,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:10,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:10,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:40:10,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:10,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:40:10,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:10,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:10,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:10,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:10,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:40:10,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:10,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:10,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:10,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:10,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:10,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:10,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:10,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:10,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:10,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:10,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:10,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:10,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:10,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:10,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:10,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:10,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:10,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:10,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:10,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:10,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:10,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:10,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,037 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:40:10,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,039 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:40:10,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:10,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:40:10,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:10,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:40:10,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:10,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:40:10,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:10,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,066 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:40:10,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,067 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:40:10,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:10,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:40:10,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:10,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:40:10,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:10,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,095 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:40:10,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,096 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:40:10,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:10,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:10,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:10,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:10,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:10,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:10,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:10,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:10,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:10,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:10,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:40:10,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:10,119 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 01:40:10,151 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-09 01:40:10,151 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-09 01:40:10,153 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 01:40:10,154 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 01:40:10,154 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 01:40:10,154 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-12-09 01:40:10,193 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-12-09 01:40:10,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 01:40:10,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:10,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:40:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:10,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:40:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:40:10,246 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-12-09 01:40:10,246 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-12-09 01:40:10,272 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 30 transitions. Complement of second has 6 states. [2018-12-09 01:40:10,273 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-12-09 01:40:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 01:40:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-09 01:40:10,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 6 letters. [2018-12-09 01:40:10,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:40:10,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2018-12-09 01:40:10,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:40:10,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 12 letters. [2018-12-09 01:40:10,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:40:10,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2018-12-09 01:40:10,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 01:40:10,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 24 transitions. [2018-12-09 01:40:10,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-09 01:40:10,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-09 01:40:10,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2018-12-09 01:40:10,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 01:40:10,278 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-09 01:40:10,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2018-12-09 01:40:10,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-09 01:40:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-09 01:40:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-12-09 01:40:10,280 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-12-09 01:40:10,280 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-12-09 01:40:10,280 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 01:40:10,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2018-12-09 01:40:10,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 01:40:10,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:40:10,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:40:10,281 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 01:40:10,281 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 01:40:10,281 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#L-1 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; 258#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 264#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 261#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;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; 262#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 266#L551-2 [2018-12-09 01:40:10,281 INFO L796 eck$LassoCheckResult]: Loop: 266#L551-2 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); 265#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; 266#L551-2 [2018-12-09 01:40:10,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:10,282 INFO L82 PathProgramCache]: Analyzing trace with hash 889572242, now seen corresponding path program 1 times [2018-12-09 01:40:10,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:10,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:10,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:10,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:10,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:10,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:10,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2018-12-09 01:40:10,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:10,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:10,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:10,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:10,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:10,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:10,300 INFO L82 PathProgramCache]: Analyzing trace with hash 180433719, now seen corresponding path program 1 times [2018-12-09 01:40:10,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:10,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:10,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:10,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:10,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:10,532 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2018-12-09 01:40:10,619 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:40:10,619 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:40:10,620 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:40:10,620 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:40:10,620 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:40:10,620 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:40:10,620 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:40:10,620 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:40:10,620 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-12-09 01:40:10,620 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:40:10,620 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:40:10,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:10,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:10,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:10,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:10,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:10,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:10,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:10,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:10,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:10,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:10,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:10,831 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2018-12-09 01:40:10,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:10,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:10,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:10,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:11,174 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-12-09 01:40:11,278 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:40:11,278 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 01:40:11,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-12-09 01:40:11,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:11,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:11,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:11,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:11,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:40:11,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:11,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:11,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-12-09 01:40:11,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:11,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:11,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:11,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:11,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:11,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:11,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:11,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:11,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:11,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:11,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:11,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:11,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:11,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:40:11,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:11,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:11,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:11,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:11,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:11,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:11,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:11,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:11,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:11,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:11,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:11,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:11,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:11,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:11,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:11,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:11,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:11,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:11,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:11,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:11,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-12-09 01:40:11,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:11,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:11,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:11,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:11,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:11,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:11,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:11,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:11,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:11,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:11,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:11,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:11,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:11,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:11,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:11,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:11,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:11,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:11,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:11,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:11,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:11,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:11,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:40:11,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:11,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:11,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:11,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:11,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:11,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:11,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:11,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:11,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:11,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:11,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:11,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:11,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:11,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:11,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:11,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:11,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:11,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:11,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:11,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:11,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:11,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:11,300 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:40:11,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:11,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:11,301 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:40:11,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:11,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:11,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:11,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:11,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:11,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:11,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:11,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:40:11,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:11,339 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 01:40:11,379 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 01:40:11,379 INFO L444 ModelExtractionUtils]: 65 out of 73 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 01:40:11,380 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 01:40:11,380 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 01:40:11,380 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 01:40:11,381 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~j~0, v_rep(select #length ULTIMATE.start_diff_~B.base)_2) = -1*ULTIMATE.start_diff_~B.offset - 4*ULTIMATE.start_diff_~j~0 + 1*v_rep(select #length ULTIMATE.start_diff_~B.base)_2 Supporting invariants [] [2018-12-09 01:40:11,421 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-12-09 01:40:11,422 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 01:40:11,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:11,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:40:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:11,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:40:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:40:11,455 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-12-09 01:40:11,455 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-09 01:40:11,470 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 38 states and 53 transitions. Complement of second has 7 states. [2018-12-09 01:40:11,471 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-12-09 01:40:11,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 01:40:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-09 01:40:11,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2018-12-09 01:40:11,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:40:11,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-09 01:40:11,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:40:11,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-09 01:40:11,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:40:11,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2018-12-09 01:40:11,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 01:40:11,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 39 transitions. [2018-12-09 01:40:11,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-09 01:40:11,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-09 01:40:11,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2018-12-09 01:40:11,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 01:40:11,474 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2018-12-09 01:40:11,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2018-12-09 01:40:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-12-09 01:40:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 01:40:11,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-12-09 01:40:11,475 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-09 01:40:11,475 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-09 01:40:11,475 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 01:40:11,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-12-09 01:40:11,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 01:40:11,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:40:11,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:40:11,476 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:40:11,476 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 01:40:11,476 INFO L794 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 421#L-1 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; 422#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 430#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 423#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;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; 424#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 432#L551-2 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); 437#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 434#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 419#L550-2 assume !(0 == diff_~found~0); 420#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 431#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 427#L551-2 [2018-12-09 01:40:11,476 INFO L796 eck$LassoCheckResult]: Loop: 427#L551-2 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); 426#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; 427#L551-2 [2018-12-09 01:40:11,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:11,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1813422420, now seen corresponding path program 2 times [2018-12-09 01:40:11,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:11,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:11,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:11,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:40:11,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:11,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:11,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2018-12-09 01:40:11,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:11,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:11,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:11,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:40:11,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:11,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:11,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1057777617, now seen corresponding path program 1 times [2018-12-09 01:40:11,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:40:11,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:40:11,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:11,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:40:11,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:40:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:40:11,869 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 140 [2018-12-09 01:40:11,956 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:40:11,956 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:40:11,956 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:40:11,956 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:40:11,956 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:40:11,956 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:40:11,956 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:40:11,956 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:40:11,956 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-12-09 01:40:11,956 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:40:11,957 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:40:11,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:11,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:11,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:11,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:12,184 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 100 [2018-12-09 01:40:12,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:12,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:12,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:12,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:12,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:12,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:12,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:12,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:12,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:12,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:12,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:40:12,567 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:40:12,567 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 01:40:12,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:12,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:12,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:12,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:12,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:12,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:12,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:12,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:12,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:12,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:12,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:12,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:12,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:12,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:12,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:40:12,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:12,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:12,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:12,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:12,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:40:12,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:12,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:12,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:12,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:40:12,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:40:12,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:12,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:12,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:12,575 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:40:12,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:12,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:12,576 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:40:12,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:12,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:12,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:12,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:12,580 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:40:12,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:12,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:12,581 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:40:12,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:12,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:12,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:12,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:12,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:12,586 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:40:12,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:12,588 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-09 01:40:12,588 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 01:40:12,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:40:12,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:40:12,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:40:12,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:40:12,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:40:12,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:40:12,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:40:12,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:40:12,652 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 01:40:12,689 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 01:40:12,689 INFO L444 ModelExtractionUtils]: 62 out of 73 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-09 01:40:12,690 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 01:40:12,690 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 01:40:12,691 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 01:40:12,691 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~B.offset, v_rep(select #length ULTIMATE.start_diff_~B.base)_3, ULTIMATE.start_diff_~j~0) = -1*ULTIMATE.start_diff_~B.offset + 1*v_rep(select #length ULTIMATE.start_diff_~B.base)_3 - 4*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-12-09 01:40:12,735 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2018-12-09 01:40:12,736 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 01:40:12,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:12,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:40:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:12,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:40:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:40:12,771 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-12-09 01:40:12,772 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-09 01:40:12,789 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 36 states and 51 transitions. Complement of second has 7 states. [2018-12-09 01:40:12,789 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-12-09 01:40:12,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 01:40:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-09 01:40:12,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-09 01:40:12,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:40:12,790 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 01:40:12,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:12,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:40:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:12,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:40:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:40:12,827 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-12-09 01:40:12,827 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-09 01:40:12,839 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 36 states and 51 transitions. Complement of second has 7 states. [2018-12-09 01:40:12,839 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-12-09 01:40:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 01:40:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-09 01:40:12,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-09 01:40:12,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:40:12,840 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 01:40:12,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:40:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:12,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:40:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:40:12,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:40:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:40:12,876 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-12-09 01:40:12,876 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-09 01:40:12,891 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 34 states and 51 transitions. Complement of second has 6 states. [2018-12-09 01:40:12,892 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-12-09 01:40:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 01:40:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-12-09 01:40:12,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-09 01:40:12,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:40:12,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-09 01:40:12,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:40:12,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 12 letters. Loop has 4 letters. [2018-12-09 01:40:12,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:40:12,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 51 transitions. [2018-12-09 01:40:12,894 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 01:40:12,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2018-12-09 01:40:12,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 01:40:12,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 01:40:12,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 01:40:12,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:40:12,894 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:40:12,894 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:40:12,894 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:40:12,895 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 01:40:12,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 01:40:12,895 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 01:40:12,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 01:40:12,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 01:40:12 BoogieIcfgContainer [2018-12-09 01:40:12,900 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 01:40:12,900 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:40:12,900 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:40:12,901 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:40:12,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:40:08" (3/4) ... [2018-12-09 01:40:12,904 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 01:40:12,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:40:12,905 INFO L168 Benchmark]: Toolchain (without parser) took 4814.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 301.5 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -265.3 MB). Peak memory consumption was 36.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:40:12,905 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:40:12,906 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:40:12,906 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:40:12,906 INFO L168 Benchmark]: Boogie Preprocessor took 15.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:40:12,907 INFO L168 Benchmark]: RCFGBuilder took 173.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2018-12-09 01:40:12,907 INFO L168 Benchmark]: BuchiAutomizer took 4343.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -139.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:40:12,907 INFO L168 Benchmark]: Witness Printer took 3.70 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:40:12,910 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 173.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4343.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -139.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.70 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 6 terminating modules (3 trivial, 2 deterministic, 1 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 -1 * B + -4 * j + unknown-#length-unknown[B] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * B + unknown-#length-unknown[B] + -4 * j and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 3.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 110 SDtfs, 127 SDslu, 48 SDs, 0 SdLazy, 78 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital273 mio100 ax100 hnf98 lsp90 ukn87 mio100 lsp53 div100 bol100 ite100 ukn100 eq182 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...