./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0c52c514-e06f-43a6-9081-557753355556/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0c52c514-e06f-43a6-9081-557753355556/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0c52c514-e06f-43a6-9081-557753355556/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0c52c514-e06f-43a6-9081-557753355556/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0c52c514-e06f-43a6-9081-557753355556/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0c52c514-e06f-43a6-9081-557753355556/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0c73140129db08253eb2666e014a272764010e16 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:12:57,268 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 02:12:57,269 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 02:12:57,277 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 02:12:57,277 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 02:12:57,278 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 02:12:57,279 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 02:12:57,280 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 02:12:57,281 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 02:12:57,281 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 02:12:57,282 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 02:12:57,282 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 02:12:57,283 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 02:12:57,283 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 02:12:57,284 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 02:12:57,285 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 02:12:57,285 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 02:12:57,286 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 02:12:57,288 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 02:12:57,289 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 02:12:57,289 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 02:12:57,290 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 02:12:57,292 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 02:12:57,292 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 02:12:57,292 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 02:12:57,293 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 02:12:57,294 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 02:12:57,294 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 02:12:57,295 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 02:12:57,296 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 02:12:57,296 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 02:12:57,296 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 02:12:57,296 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 02:12:57,296 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 02:12:57,297 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 02:12:57,297 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 02:12:57,297 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0c52c514-e06f-43a6-9081-557753355556/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 02:12:57,309 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 02:12:57,309 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 02:12:57,310 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 02:12:57,310 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 02:12:57,310 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 02:12:57,310 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 02:12:57,310 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 02:12:57,311 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 02:12:57,311 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 02:12:57,311 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 02:12:57,311 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 02:12:57,311 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 02:12:57,311 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 02:12:57,311 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 02:12:57,311 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 02:12:57,311 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 02:12:57,312 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 02:12:57,312 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 02:12:57,312 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 02:12:57,312 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 02:12:57,312 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 02:12:57,312 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 02:12:57,312 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 02:12:57,313 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 02:12:57,313 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 02:12:57,313 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 02:12:57,313 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 02:12:57,313 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 02:12:57,313 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 02:12:57,314 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_0c52c514-e06f-43a6-9081-557753355556/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c73140129db08253eb2666e014a272764010e16 [2018-12-09 02:12:57,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 02:12:57,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 02:12:57,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 02:12:57,344 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 02:12:57,344 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 02:12:57,345 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0c52c514-e06f-43a6-9081-557753355556/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i [2018-12-09 02:12:57,379 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c52c514-e06f-43a6-9081-557753355556/bin-2019/uautomizer/data/280c3b32e/57b6e485d13046a2bedcfd8d95364597/FLAGaf60c6d6c [2018-12-09 02:12:57,821 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 02:12:57,821 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0c52c514-e06f-43a6-9081-557753355556/sv-benchmarks/c/termination-memory-alloca/diff-alloca_true-termination.c.i [2018-12-09 02:12:57,827 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c52c514-e06f-43a6-9081-557753355556/bin-2019/uautomizer/data/280c3b32e/57b6e485d13046a2bedcfd8d95364597/FLAGaf60c6d6c [2018-12-09 02:12:57,836 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0c52c514-e06f-43a6-9081-557753355556/bin-2019/uautomizer/data/280c3b32e/57b6e485d13046a2bedcfd8d95364597 [2018-12-09 02:12:57,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 02:12:57,838 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 02:12:57,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 02:12:57,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 02:12:57,841 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 02:12:57,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:12:57" (1/1) ... [2018-12-09 02:12:57,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e48869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:57, skipping insertion in model container [2018-12-09 02:12:57,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:12:57" (1/1) ... [2018-12-09 02:12:57,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 02:12:57,865 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 02:12:58,007 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:12:58,049 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 02:12:58,071 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:12:58,090 INFO L195 MainTranslator]: Completed translation [2018-12-09 02:12:58,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:58 WrapperNode [2018-12-09 02:12:58,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 02:12:58,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 02:12:58,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 02:12:58,091 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 02:12:58,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:58" (1/1) ... [2018-12-09 02:12:58,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:58" (1/1) ... [2018-12-09 02:12:58,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 02:12:58,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 02:12:58,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 02:12:58,117 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 02:12:58,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:58" (1/1) ... [2018-12-09 02:12:58,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:58" (1/1) ... [2018-12-09 02:12:58,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:58" (1/1) ... [2018-12-09 02:12:58,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:58" (1/1) ... [2018-12-09 02:12:58,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:58" (1/1) ... [2018-12-09 02:12:58,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:58" (1/1) ... [2018-12-09 02:12:58,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:58" (1/1) ... [2018-12-09 02:12:58,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 02:12:58,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 02:12:58,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 02:12:58,132 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 02:12:58,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c52c514-e06f-43a6-9081-557753355556/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 02:12:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 02:12:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 02:12:58,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 02:12:58,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 02:12:58,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 02:12:58,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 02:12:58,296 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 02:12:58,296 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 02:12:58,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:12:58 BoogieIcfgContainer [2018-12-09 02:12:58,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 02:12:58,297 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 02:12:58,297 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 02:12:58,299 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 02:12:58,300 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 02:12:58,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 02:12:57" (1/3) ... [2018-12-09 02:12:58,301 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15d4da7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 02:12:58, skipping insertion in model container [2018-12-09 02:12:58,301 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 02:12:58,301 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:58" (2/3) ... [2018-12-09 02:12:58,301 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15d4da7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 02:12:58, skipping insertion in model container [2018-12-09 02:12:58,301 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 02:12:58,301 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:12:58" (3/3) ... [2018-12-09 02:12:58,302 INFO L375 chiAutomizerObserver]: Analyzing ICFG diff-alloca_true-termination.c.i [2018-12-09 02:12:58,344 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 02:12:58,345 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 02:12:58,345 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 02:12:58,345 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 02:12:58,345 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 02:12:58,345 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 02:12:58,345 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 02:12:58,345 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 02:12:58,345 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 02:12:58,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-09 02:12:58,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 02:12:58,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:12:58,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:12:58,382 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 02:12:58,382 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 02:12:58,382 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 02:12:58,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-09 02:12:58,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 02:12:58,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:12:58,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:12:58,384 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 02:12:58,384 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 02:12:58,391 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#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; 9#L574true assume !(main_~Alen~0 < 1); 14#L574-2true assume !(main_~Blen~0 < 1); 7#L577-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; 12#L554-2true [2018-12-09 02:12:58,391 INFO L796 eck$LassoCheckResult]: Loop: 12#L554-2true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 5#L558-2true assume !true; 6#L557-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; 11#L564-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 12#L554-2true [2018-12-09 02:12:58,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:12:58,396 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-09 02:12:58,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:12:58,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:12:58,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:12:58,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:12:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:12:58,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:12:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1679350, now seen corresponding path program 1 times [2018-12-09 02:12:58,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:12:58,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:12:58,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:12:58,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:12:58,507 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 02:12:58,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:12:58,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 02:12:58,511 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 02:12:58,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 02:12:58,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 02:12:58,521 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-12-09 02:12:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:12:58,525 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-12-09 02:12:58,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 02:12:58,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2018-12-09 02:12:58,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 02:12:58,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 15 transitions. [2018-12-09 02:12:58,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 02:12:58,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 02:12:58,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2018-12-09 02:12:58,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 02:12:58,530 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-12-09 02:12:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2018-12-09 02:12:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-09 02:12:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-09 02:12:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-12-09 02:12:58,547 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-12-09 02:12:58,547 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-12-09 02:12:58,547 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 02:12:58,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2018-12-09 02:12:58,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 02:12:58,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:12:58,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:12:58,548 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 02:12:58,548 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 02:12:58,548 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#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; 37#L574 assume !(main_~Alen~0 < 1); 38#L574-2 assume !(main_~Blen~0 < 1); 44#L577-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; 42#L554-2 [2018-12-09 02:12:58,548 INFO L796 eck$LassoCheckResult]: Loop: 42#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 40#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 45#L557-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; 41#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 42#L554-2 [2018-12-09 02:12:58,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:12:58,549 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-09 02:12:58,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:12:58,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:12:58,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:12:58,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:12:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:12:58,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:12:58,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1669740, now seen corresponding path program 1 times [2018-12-09 02:12:58,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:12:58,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:12:58,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:12:58,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:12:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:12:58,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:12:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1298476337, now seen corresponding path program 1 times [2018-12-09 02:12:58,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:12:58,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:12:58,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:12:58,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:12:58,633 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 02:12:58,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:12:58,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:12:58,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:12:58,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:12:58,717 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-12-09 02:12:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:12:58,749 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2018-12-09 02:12:58,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:12:58,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2018-12-09 02:12:58,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 02:12:58,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2018-12-09 02:12:58,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-09 02:12:58,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-09 02:12:58,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2018-12-09 02:12:58,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 02:12:58,751 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-12-09 02:12:58,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2018-12-09 02:12:58,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-12-09 02:12:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-09 02:12:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-12-09 02:12:58,753 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-12-09 02:12:58,753 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-12-09 02:12:58,753 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 02:12:58,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2018-12-09 02:12:58,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 02:12:58,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:12:58,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:12:58,754 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 02:12:58,754 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 02:12:58,754 INFO L794 eck$LassoCheckResult]: Stem: 79#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#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; 73#L574 assume !(main_~Alen~0 < 1); 76#L574-2 assume !(main_~Blen~0 < 1); 81#L577-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; 78#L554-2 [2018-12-09 02:12:58,754 INFO L796 eck$LassoCheckResult]: Loop: 78#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 80#L558-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); 74#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 75#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 82#L557-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; 77#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 78#L554-2 [2018-12-09 02:12:58,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:12:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2018-12-09 02:12:58,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:12:58,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:12:58,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:12:58,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:12:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:12:58,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:12:58,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183209, now seen corresponding path program 1 times [2018-12-09 02:12:58,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:12:58,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:12:58,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:12:58,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:12:58,787 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 02:12:58,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:12:58,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:12:58,787 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 02:12:58,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:12:58,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:12:58,788 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-12-09 02:12:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:12:58,804 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-12-09 02:12:58,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:12:58,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-12-09 02:12:58,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-09 02:12:58,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2018-12-09 02:12:58,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-09 02:12:58,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 02:12:58,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-12-09 02:12:58,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 02:12:58,806 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-09 02:12:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-12-09 02:12:58,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-12-09 02:12:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-09 02:12:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-12-09 02:12:58,808 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-12-09 02:12:58,808 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-12-09 02:12:58,808 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 02:12:58,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2018-12-09 02:12:58,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 02:12:58,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:12:58,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:12:58,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 02:12:58,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 02:12:58,809 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 107#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; 108#L574 assume !(main_~Alen~0 < 1); 112#L574-2 assume !(main_~Blen~0 < 1); 118#L577-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; 114#L554-2 [2018-12-09 02:12:58,809 INFO L796 eck$LassoCheckResult]: Loop: 114#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 116#L558-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); 109#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 110#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 117#L557-2 assume !(0 == diff_~found~0); 113#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 114#L554-2 [2018-12-09 02:12:58,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:12:58,809 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2018-12-09 02:12:58,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:12:58,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:12:58,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:12:58,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:12:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:12:58,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:12:58,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183271, now seen corresponding path program 1 times [2018-12-09 02:12:58,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:12:58,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:12:58,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:12:58,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:12:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:12:58,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:12:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1998160148, now seen corresponding path program 1 times [2018-12-09 02:12:58,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:12:58,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:12:58,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:12:58,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:12:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:12:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:12:59,037 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-12-09 02:12:59,136 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:12:59,137 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:12:59,137 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:12:59,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:12:59,137 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:12:59,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:12:59,137 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:12:59,137 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:12:59,137 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-09 02:12:59,137 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:12:59,138 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:12:59,155 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 02:12:59,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:12:59,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:12:59,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:12:59,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:12:59,167 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 02:12:59,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:12:59,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:12:59,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:12:59,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:12:59,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:12:59,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:12:59,176 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 02:12:59,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:12:59,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:12:59,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:12:59,382 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2018-12-09 02:12:59,410 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 02:12:59,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 02:12:59,749 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:12:59,754 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:12:59,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:12:59,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:12:59,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:12:59,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:12:59,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:12:59,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:12:59,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:12:59,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:12:59,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:12:59,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:12:59,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:12:59,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:12:59,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:12:59,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:12:59,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:12:59,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:12:59,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:12:59,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:12:59,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:12:59,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:12:59,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:12:59,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:12:59,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:12:59,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:12:59,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:12:59,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:12:59,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:12:59,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:12:59,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:12:59,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:12:59,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:12:59,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:12:59,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:12:59,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:12:59,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:12:59,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:12:59,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:12:59,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:12:59,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:12:59,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:12:59,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:12:59,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:12:59,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:12:59,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:12:59,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:12:59,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:12:59,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:12:59,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:12:59,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:12:59,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:12:59,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:12:59,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:12:59,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:12:59,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:12:59,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:12:59,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:12:59,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,802 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:12:59,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,804 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:12:59,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:12:59,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:12:59,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:12:59,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:12:59,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:12:59,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:12:59,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:12:59,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:12:59,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:12:59,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:12:59,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:12:59,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,829 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:12:59,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,830 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:12:59,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:12:59,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:12:59,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:12:59,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:12:59,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:12:59,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:12:59,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:12:59,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:12:59,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,854 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:12:59,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,855 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:12:59,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:12:59,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:12:59,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:12:59,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:12:59,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:12:59,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:12:59,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:12:59,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:12:59,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:12:59,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:12:59,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:12:59,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:12:59,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:12:59,878 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:12:59,891 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 02:12:59,891 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 02:12:59,893 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:12:59,894 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 02:12:59,894 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:12:59,895 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, v_rep(select #length ULTIMATE.start_diff_~A.base)_1, ULTIMATE.start_diff_~A.offset) = -4*ULTIMATE.start_diff_~i~0 + 1*v_rep(select #length ULTIMATE.start_diff_~A.base)_1 - 1*ULTIMATE.start_diff_~A.offset Supporting invariants [] [2018-12-09 02:12:59,940 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-12-09 02:12:59,945 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 02:12:59,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:12:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:12:59,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:12:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:12:59,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:12:59,987 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 02:12:59,989 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 02:12:59,990 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-12-09 02:13:00,016 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 02:13:00,016 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 02:13:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 02:13:00,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-09 02:13:00,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 6 letters. [2018-12-09 02:13:00,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:13:00,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2018-12-09 02:13:00,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:13:00,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 12 letters. [2018-12-09 02:13:00,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:13:00,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2018-12-09 02:13:00,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 02:13:00,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 24 transitions. [2018-12-09 02:13:00,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-09 02:13:00,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-09 02:13:00,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2018-12-09 02:13:00,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:13:00,020 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-09 02:13:00,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2018-12-09 02:13:00,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-09 02:13:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-09 02:13:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-12-09 02:13:00,021 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-12-09 02:13:00,021 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-12-09 02:13:00,021 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 02:13:00,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2018-12-09 02:13:00,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 02:13:00,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:13:00,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:13:00,021 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 02:13:00,021 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 02:13:00,021 INFO L794 eck$LassoCheckResult]: Stem: 265#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#L574 assume !(main_~Alen~0 < 1); 259#L574-2 assume !(main_~Blen~0 < 1); 270#L577-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; 268#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 261#L558-2 [2018-12-09 02:13:00,022 INFO L796 eck$LassoCheckResult]: Loop: 261#L558-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); 260#L558 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; 261#L558-2 [2018-12-09 02:13:00,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:13:00,022 INFO L82 PathProgramCache]: Analyzing trace with hash 889572242, now seen corresponding path program 1 times [2018-12-09 02:13:00,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:13:00,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:13:00,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:13:00,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:13:00,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:13:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:13:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:13:00,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:13:00,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2018-12-09 02:13:00,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:13:00,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:13:00,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:13:00,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:13:00,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:13:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:13:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:13:00,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:13:00,034 INFO L82 PathProgramCache]: Analyzing trace with hash 180433719, now seen corresponding path program 1 times [2018-12-09 02:13:00,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:13:00,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:13:00,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:13:00,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:13:00,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:13:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:13:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:13:00,250 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2018-12-09 02:13:00,347 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:13:00,348 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:13:00,348 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:13:00,348 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:13:00,348 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:13:00,348 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:13:00,348 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:13:00,348 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:13:00,348 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration5_Lasso [2018-12-09 02:13:00,348 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:13:00,348 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:13:00,351 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 02:13:00,353 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 02:13:00,354 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 02:13:00,355 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 02:13:00,356 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 02:13:00,357 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 02:13:00,358 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 02:13:00,359 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 02:13:00,360 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 02:13:00,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:13:00,362 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 02:13:00,363 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 02:13:00,539 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2018-12-09 02:13:00,559 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 02:13:00,560 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 02:13:00,562 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 02:13:00,566 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 02:13:00,566 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 02:13:00,568 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 02:13:00,902 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:13:00,902 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:13:00,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:00,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:00,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:00,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:00,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:00,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:00,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:00,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:00,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:00,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:00,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:13:00,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:00,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:00,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:00,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:13:00,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:13:00,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:00,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:00,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:00,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:00,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:00,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:00,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:00,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:00,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:00,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:00,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:00,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:13:00,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:00,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:00,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:00,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:13:00,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:13:00,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:00,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:00,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:00,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:13:00,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:00,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:00,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:00,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:13:00,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:13:00,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:00,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:00,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:00,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:00,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:00,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:00,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:00,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:00,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:00,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:00,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:00,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:13:00,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:00,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:00,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:00,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:13:00,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:13:00,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:00,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:00,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:00,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:13:00,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:00,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:00,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:00,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:13:00,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:13:00,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:00,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:00,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:00,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:00,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:00,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:00,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:00,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:00,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:00,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:00,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:00,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:13:00,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:00,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:00,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:00,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:13:00,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:13:00,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:00,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:00,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:00,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:13:00,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:00,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:00,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:00,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:13:00,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:13:00,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:00,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:00,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:00,926 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:13:00,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:00,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:00,927 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:13:00,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:00,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:00,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:00,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:00,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:00,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:00,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:00,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:00,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:00,954 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:13:00,966 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 02:13:00,966 INFO L444 ModelExtractionUtils]: 69 out of 73 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 02:13:00,966 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:13:00,967 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 02:13:00,967 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:13:00,967 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-12-09 02:13:00,998 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-12-09 02:13:01,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:13:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:13:01,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:13:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:13:01,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:13:01,027 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 02:13:01,027 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 02:13:01,028 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-09 02:13:01,039 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 02:13:01,039 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 02:13:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 02:13:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-09 02:13:01,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2018-12-09 02:13:01,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:13:01,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-09 02:13:01,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:13:01,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-09 02:13:01,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:13:01,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2018-12-09 02:13:01,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 02:13:01,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 39 transitions. [2018-12-09 02:13:01,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-09 02:13:01,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-09 02:13:01,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2018-12-09 02:13:01,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:13:01,042 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2018-12-09 02:13:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2018-12-09 02:13:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-12-09 02:13:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 02:13:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-12-09 02:13:01,044 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-09 02:13:01,044 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-09 02:13:01,044 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 02:13:01,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-12-09 02:13:01,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 02:13:01,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:13:01,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:13:01,045 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:13:01,045 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 02:13:01,045 INFO L794 eck$LassoCheckResult]: Stem: 428#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#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; 420#L574 assume !(main_~Alen~0 < 1); 425#L574-2 assume !(main_~Blen~0 < 1); 433#L577-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; 429#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 430#L558-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#L558 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; 438#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 435#L557-2 assume !(0 == diff_~found~0); 426#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 427#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 422#L558-2 [2018-12-09 02:13:01,045 INFO L796 eck$LassoCheckResult]: Loop: 422#L558-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); 421#L558 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; 422#L558-2 [2018-12-09 02:13:01,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:13:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1811575378, now seen corresponding path program 1 times [2018-12-09 02:13:01,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:13:01,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:13:01,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:13:01,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:13:01,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:13:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:13:01,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 02:13:01,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:13:01,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:13:01,055 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 02:13:01,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:13:01,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2018-12-09 02:13:01,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:13:01,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:13:01,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:13:01,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:13:01,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:13:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:13:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:13:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:13:01,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:13:01,099 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-09 02:13:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:13:01,108 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2018-12-09 02:13:01,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:13:01,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2018-12-09 02:13:01,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 02:13:01,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 31 transitions. [2018-12-09 02:13:01,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-09 02:13:01,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-09 02:13:01,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2018-12-09 02:13:01,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:13:01,110 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-12-09 02:13:01,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2018-12-09 02:13:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-12-09 02:13:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 02:13:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-12-09 02:13:01,112 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-12-09 02:13:01,112 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-12-09 02:13:01,112 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 02:13:01,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2018-12-09 02:13:01,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 02:13:01,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:13:01,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:13:01,113 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:13:01,113 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 02:13:01,113 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 467#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; 468#L574 assume !(main_~Alen~0 < 1); 473#L574-2 assume !(main_~Blen~0 < 1); 480#L577-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; 477#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 478#L558-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); 486#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 484#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 482#L557-2 assume !(0 == diff_~found~0); 474#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 475#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 470#L558-2 [2018-12-09 02:13:01,113 INFO L796 eck$LassoCheckResult]: Loop: 470#L558-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); 469#L558 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; 470#L558-2 [2018-12-09 02:13:01,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:13:01,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1813422420, now seen corresponding path program 2 times [2018-12-09 02:13:01,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:13:01,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:13:01,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:13:01,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:13:01,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:13:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:13:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:13:01,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:13:01,130 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 3 times [2018-12-09 02:13:01,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:13:01,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:13:01,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:13:01,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:13:01,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:13:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:13:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:13:01,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:13:01,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1057777617, now seen corresponding path program 1 times [2018-12-09 02:13:01,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:13:01,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:13:01,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:13:01,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:13:01,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:13:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:13:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:13:01,486 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 133 [2018-12-09 02:13:01,577 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:13:01,577 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:13:01,577 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:13:01,577 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:13:01,577 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:13:01,577 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:13:01,577 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:13:01,577 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:13:01,577 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration7_Lasso [2018-12-09 02:13:01,577 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:13:01,577 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:13:01,579 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 02:13:01,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:13:01,582 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 02:13:01,583 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 02:13:01,584 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 02:13:01,585 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 02:13:01,586 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 02:13:01,587 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 02:13:01,588 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 02:13:01,589 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 02:13:01,595 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 02:13:01,596 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 02:13:01,598 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 02:13:01,599 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 02:13:01,600 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 02:13:01,601 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 02:13:01,601 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 02:13:01,806 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 98 [2018-12-09 02:13:01,837 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 02:13:02,161 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:13:02,161 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:13:02,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:13:02,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:13:02,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:13:02,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:02,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:02,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:13:02,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:13:02,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:13:02,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:13:02,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:02,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:02,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:13:02,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:13:02,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:13:02,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:13:02,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:13:02,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:13:02,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:13:02,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:13:02,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:13:02,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:02,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:02,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:13:02,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:13:02,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:13:02,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:13:02,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:13:02,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:02,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:02,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:13:02,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:13:02,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:13:02,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:13:02,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:02,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:02,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:02,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:02,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:13:02,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:02,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:02,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:13:02,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:13:02,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:13:02,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:13:02,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:13:02,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:13:02,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:13:02,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,194 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:13:02,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,195 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:13:02,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:02,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,199 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:13:02,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,200 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:13:02,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:02,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:02,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:02,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,207 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 02:13:02,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,209 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-09 02:13:02,209 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 02:13:02,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:02,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:02,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:02,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:02,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:02,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:02,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:02,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:02,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,228 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 02:13:02,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,229 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 02:13:02,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:02,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:13:02,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:13:02,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:13:02,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:13:02,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:13:02,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:13:02,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:13:02,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:13:02,256 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:13:02,276 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 02:13:02,276 INFO L444 ModelExtractionUtils]: 59 out of 64 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 02:13:02,276 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:13:02,277 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 02:13:02,277 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:13:02,277 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-12-09 02:13:02,313 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2018-12-09 02:13:02,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:13:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:13:02,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:13:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:13:02,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:13:02,362 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 02:13:02,362 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 02:13:02,362 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-09 02:13:02,373 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 36 states and 48 transitions. Complement of second has 7 states. [2018-12-09 02:13:02,373 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 02:13:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 02:13:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-09 02:13:02,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-09 02:13:02,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:13:02,374 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 02:13:02,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:13:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:13:02,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:13:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:13:02,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:13:02,403 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 02:13:02,403 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 02:13:02,403 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-09 02:13:02,411 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 36 states and 48 transitions. Complement of second has 7 states. [2018-12-09 02:13:02,412 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 02:13:02,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 02:13:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-09 02:13:02,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-09 02:13:02,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:13:02,412 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 02:13:02,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:13:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:13:02,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:13:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:13:02,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:13:02,442 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 02:13:02,442 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 02:13:02,442 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-09 02:13:02,451 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 34 states and 49 transitions. Complement of second has 6 states. [2018-12-09 02:13:02,451 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 02:13:02,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 02:13:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-12-09 02:13:02,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-09 02:13:02,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:13:02,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-09 02:13:02,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:13:02,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 12 letters. Loop has 4 letters. [2018-12-09 02:13:02,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:13:02,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2018-12-09 02:13:02,453 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 02:13:02,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2018-12-09 02:13:02,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 02:13:02,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 02:13:02,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 02:13:02,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 02:13:02,453 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 02:13:02,453 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 02:13:02,453 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 02:13:02,453 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 02:13:02,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 02:13:02,453 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 02:13:02,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 02:13:02,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 02:13:02 BoogieIcfgContainer [2018-12-09 02:13:02,457 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 02:13:02,457 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 02:13:02,458 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 02:13:02,458 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 02:13:02,458 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:12:58" (3/4) ... [2018-12-09 02:13:02,460 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 02:13:02,460 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 02:13:02,461 INFO L168 Benchmark]: Toolchain (without parser) took 4622.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -125.6 MB). Peak memory consumption was 68.4 MB. Max. memory is 11.5 GB. [2018-12-09 02:13:02,461 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:13:02,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-09 02:13:02,462 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 02:13:02,462 INFO L168 Benchmark]: Boogie Preprocessor took 14.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 02:13:02,462 INFO L168 Benchmark]: RCFGBuilder took 164.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-09 02:13:02,462 INFO L168 Benchmark]: BuchiAutomizer took 4160.25 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 93.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -9.5 MB). Peak memory consumption was 83.8 MB. Max. memory is 11.5 GB. [2018-12-09 02:13:02,463 INFO L168 Benchmark]: Witness Printer took 2.60 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 02:13:02,465 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 252.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 164.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4160.25 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 93.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -9.5 MB). Peak memory consumption was 83.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.60 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[A] + -1 * A and consists of 4 locations. One deterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.6s. 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 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 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: 127 SDtfs, 126 SDslu, 59 SDs, 0 SdLazy, 74 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital264 mio100 ax106 hnf99 lsp84 ukn87 mio100 lsp50 div100 bol100 ite100 ukn100 eq185 hnf89 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms 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...