./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_malloc_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4ce44c97-68b2-4da0-91db-cbfcb2e49338/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4ce44c97-68b2-4da0-91db-cbfcb2e49338/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4ce44c97-68b2-4da0-91db-cbfcb2e49338/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4ce44c97-68b2-4da0-91db-cbfcb2e49338/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_malloc_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4ce44c97-68b2-4da0-91db-cbfcb2e49338/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4ce44c97-68b2-4da0-91db-cbfcb2e49338/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 9b8825911d7551a36ae924528ba18cf2d7bccc78 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:24:12,253 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:24:12,254 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:24:12,262 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:24:12,262 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:24:12,263 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:24:12,264 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:24:12,265 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:24:12,266 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:24:12,266 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:24:12,267 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:24:12,267 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:24:12,268 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:24:12,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:24:12,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:24:12,269 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:24:12,270 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:24:12,271 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:24:12,272 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:24:12,273 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:24:12,274 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:24:12,274 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:24:12,276 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:24:12,276 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:24:12,276 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:24:12,276 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:24:12,277 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:24:12,277 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:24:12,278 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:24:12,278 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:24:12,278 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:24:12,279 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:24:12,279 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:24:12,279 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:24:12,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:24:12,280 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:24:12,280 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4ce44c97-68b2-4da0-91db-cbfcb2e49338/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 05:24:12,288 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:24:12,288 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:24:12,289 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:24:12,289 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:24:12,289 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:24:12,289 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 05:24:12,289 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 05:24:12,290 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 05:24:12,290 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 05:24:12,290 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 05:24:12,290 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 05:24:12,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:24:12,290 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:24:12,290 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:24:12,290 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:24:12,290 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 05:24:12,291 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 05:24:12,291 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 05:24:12,291 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:24:12,291 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 05:24:12,291 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:24:12,291 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 05:24:12,291 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:24:12,291 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:24:12,291 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 05:24:12,291 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:24:12,291 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:24:12,291 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 05:24:12,292 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 05:24:12,292 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_4ce44c97-68b2-4da0-91db-cbfcb2e49338/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 -> 9b8825911d7551a36ae924528ba18cf2d7bccc78 [2018-11-23 05:24:12,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:24:12,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:24:12,324 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:24:12,325 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:24:12,325 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:24:12,326 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4ce44c97-68b2-4da0-91db-cbfcb2e49338/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_malloc_true-termination.c.i [2018-11-23 05:24:12,363 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ce44c97-68b2-4da0-91db-cbfcb2e49338/bin-2019/uautomizer/data/cc85a33a3/a93b9d8056c54a83acdf8254eacd0aba/FLAG48fe5e72b [2018-11-23 05:24:12,732 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:24:12,732 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4ce44c97-68b2-4da0-91db-cbfcb2e49338/sv-benchmarks/c/termination-15/cstrcspn_malloc_true-termination.c.i [2018-11-23 05:24:12,740 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ce44c97-68b2-4da0-91db-cbfcb2e49338/bin-2019/uautomizer/data/cc85a33a3/a93b9d8056c54a83acdf8254eacd0aba/FLAG48fe5e72b [2018-11-23 05:24:13,125 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4ce44c97-68b2-4da0-91db-cbfcb2e49338/bin-2019/uautomizer/data/cc85a33a3/a93b9d8056c54a83acdf8254eacd0aba [2018-11-23 05:24:13,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:24:13,128 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:24:13,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:24:13,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:24:13,130 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:24:13,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:24:13" (1/1) ... [2018-11-23 05:24:13,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42991bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:24:13, skipping insertion in model container [2018-11-23 05:24:13,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:24:13" (1/1) ... [2018-11-23 05:24:13,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:24:13,163 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:24:13,354 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:24:13,360 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:24:13,393 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:24:13,481 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:24:13,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:24:13 WrapperNode [2018-11-23 05:24:13,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:24:13,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:24:13,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:24:13,482 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:24:13,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:24:13" (1/1) ... [2018-11-23 05:24:13,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:24:13" (1/1) ... [2018-11-23 05:24:13,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:24:13,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:24:13,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:24:13,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:24:13,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:24:13" (1/1) ... [2018-11-23 05:24:13,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:24:13" (1/1) ... [2018-11-23 05:24:13,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:24:13" (1/1) ... [2018-11-23 05:24:13,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:24:13" (1/1) ... [2018-11-23 05:24:13,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:24:13" (1/1) ... [2018-11-23 05:24:13,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:24:13" (1/1) ... [2018-11-23 05:24:13,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:24:13" (1/1) ... [2018-11-23 05:24:13,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:24:13,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:24:13,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:24:13,529 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:24:13,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:24:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce44c97-68b2-4da0-91db-cbfcb2e49338/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:24:13,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:24:13,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:24:13,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:24:13,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:24:13,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:24:13,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:24:13,731 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:24:13,732 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 05:24:13,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:24:13 BoogieIcfgContainer [2018-11-23 05:24:13,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:24:13,733 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 05:24:13,733 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 05:24:13,736 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 05:24:13,736 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:24:13,736 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 05:24:13" (1/3) ... [2018-11-23 05:24:13,737 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23c8b4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:24:13, skipping insertion in model container [2018-11-23 05:24:13,737 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:24:13,737 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:24:13" (2/3) ... [2018-11-23 05:24:13,738 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23c8b4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:24:13, skipping insertion in model container [2018-11-23 05:24:13,738 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:24:13,738 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:24:13" (3/3) ... [2018-11-23 05:24:13,739 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_malloc_true-termination.c.i [2018-11-23 05:24:13,779 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:24:13,780 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 05:24:13,780 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 05:24:13,780 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 05:24:13,780 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:24:13,780 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:24:13,780 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 05:24:13,780 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:24:13,780 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 05:24:13,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 05:24:13,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 05:24:13,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:24:13,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:24:13,815 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 05:24:13,815 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 05:24:13,815 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 05:24:13,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 05:24:13,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 05:24:13,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:24:13,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:24:13,817 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 05:24:13,817 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 05:24:13,823 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2018-11-23 05:24:13,823 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2018-11-23 05:24:13,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:13,827 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 05:24:13,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:24:13,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:24:13,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:13,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:24:13,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:13,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:13,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-23 05:24:13,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:24:13,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:24:13,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:13,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:24:13,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:24:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:24:13,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:24:13,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:24:13,959 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 05:24:13,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 05:24:13,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:24:13,970 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 05:24:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:24:13,974 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 05:24:13,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 05:24:13,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-23 05:24:13,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 05:24:13,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-23 05:24:13,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 05:24:13,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 05:24:13,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-23 05:24:13,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:24:13,981 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 05:24:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-23 05:24:13,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 05:24:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 05:24:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-23 05:24:13,997 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 05:24:13,997 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 05:24:13,997 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 05:24:13,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-23 05:24:13,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 05:24:13,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:24:13,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:24:13,999 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 05:24:13,999 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:24:13,999 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 47#L369-4 [2018-11-23 05:24:13,999 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2018-11-23 05:24:13,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:13,999 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 05:24:13,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:24:13,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:24:14,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:14,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:24:14,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:14,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:14,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-23 05:24:14,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:24:14,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:24:14,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:14,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:24:14,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:14,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:14,046 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-23 05:24:14,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:24:14,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:24:14,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:14,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:24:14,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:14,250 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-23 05:24:14,397 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-23 05:24:14,547 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-23 05:24:14,627 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:24:14,628 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:24:14,628 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:24:14,628 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:24:14,628 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:24:14,628 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:24:14,628 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:24:14,628 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:24:14,629 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_malloc_true-termination.c.i_Iteration2_Lasso [2018-11-23 05:24:14,629 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:24:14,629 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:24:14,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:14,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:15,308 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2018-11-23 05:24:15,418 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:24:15,423 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:24:15,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:15,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:15,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:15,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:15,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:15,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:15,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:15,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:15,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:15,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:15,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:15,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:15,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:15,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:15,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:15,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:15,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:15,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:15,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:15,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:15,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:15,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:15,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:15,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:15,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:15,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:15,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:15,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:15,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:15,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:15,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:15,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:15,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:15,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:15,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:15,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:15,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:15,445 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:24:15,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:15,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:15,449 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:24:15,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:15,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:15,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:15,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:15,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:15,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:15,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:15,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:15,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:15,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:15,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:15,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:15,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:15,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:15,471 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 05:24:15,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:15,474 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:24:15,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:15,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:15,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:15,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:15,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:15,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:15,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:15,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:15,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:15,517 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:24:15,531 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 05:24:15,531 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 05:24:15,533 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:24:15,534 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:24:15,534 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:24:15,535 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2018-11-23 05:24:15,614 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 05:24:15,619 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 05:24:15,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:24:15,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:24:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:24:15,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:24:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:24:15,697 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 05:24:15,698 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 05:24:15,782 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-11-23 05:24:15,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 05:24:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:24:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-23 05:24:15,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 05:24:15,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:24:15,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-23 05:24:15,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:24:15,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-23 05:24:15,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:24:15,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-23 05:24:15,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:24:15,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-23 05:24:15,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 05:24:15,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 05:24:15,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-23 05:24:15,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:24:15,787 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 05:24:15,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-23 05:24:15,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 05:24:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 05:24:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-23 05:24:15,789 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 05:24:15,789 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 05:24:15,789 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 05:24:15,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-23 05:24:15,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:24:15,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:24:15,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:24:15,789 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:24:15,789 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:24:15,790 INFO L794 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 187#L382 assume !(main_~length1~0 < 1); 188#L382-2 assume !(main_~length2~0 < 1); 185#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 182#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 184#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 194#L372-5 [2018-11-23 05:24:15,790 INFO L796 eck$LassoCheckResult]: Loop: 194#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 189#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 190#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 194#L372-5 [2018-11-23 05:24:15,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:15,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-23 05:24:15,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:24:15,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:24:15,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:15,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:24:15,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:15,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:15,808 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-23 05:24:15,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:24:15,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:24:15,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:15,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:24:15,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:15,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:15,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-23 05:24:15,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:24:15,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:24:15,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:15,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:24:15,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:16,183 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-23 05:24:16,255 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:24:16,255 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:24:16,255 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:24:16,255 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:24:16,255 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:24:16,255 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:24:16,255 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:24:16,255 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:24:16,255 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_malloc_true-termination.c.i_Iteration3_Lasso [2018-11-23 05:24:16,255 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:24:16,255 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:24:16,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:16,468 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-11-23 05:24:16,903 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:24:16,903 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:24:16,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-11-23 05:24:16,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:16,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:16,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:16,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,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-11-23 05:24:16,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:16,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:16,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:16,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:16,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:16,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:16,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:16,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:16,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,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-11-23 05:24:16,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:16,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:16,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:16,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:16,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:16,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:16,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,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-11-23 05:24:16,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:16,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:16,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:16,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:16,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:16,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:16,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:16,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:16,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:16,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:16,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:16,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:16,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:16,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:16,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:16,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:16,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:16,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:16,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:16,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:16,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:16,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:16,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:16,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:16,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:16,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:16,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:16,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:16,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:16,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:16,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:16,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:16,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:16,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:16,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:16,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:16,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:16,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:16,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:16,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:16,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:16,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:16,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:16,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:16,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:16,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:16,960 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:24:16,960 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-23 05:24:16,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:16,983 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-23 05:24:16,984 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 05:24:17,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:17,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:17,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:17,064 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:24:17,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:17,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:17,066 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:24:17,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:17,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:17,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:17,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:17,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:17,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:17,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:17,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:17,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:17,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:17,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:17,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:17,074 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:24:17,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:17,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:17,076 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:24:17,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:17,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:17,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:17,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:17,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:17,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:17,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:17,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:17,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:17,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:17,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:17,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:17,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:17,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:17,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:17,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:17,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:17,102 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:24:17,115 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 05:24:17,115 INFO L444 ModelExtractionUtils]: 45 out of 52 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 05:24:17,116 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:24:17,116 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:24:17,117 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:24:17,117 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_2) = -1*ULTIMATE.start_cstrcspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_2 Supporting invariants [] [2018-11-23 05:24:17,177 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-23 05:24:17,179 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 05:24:17,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:24:17,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:24:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:24:17,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:24:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:24:17,226 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 05:24:17,226 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 05:24:17,256 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2018-11-23 05:24:17,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 05:24:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:24:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 05:24:17,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 05:24:17,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:24:17,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 05:24:17,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:24:17,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 05:24:17,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:24:17,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-23 05:24:17,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:24:17,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-23 05:24:17,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 05:24:17,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 05:24:17,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-23 05:24:17,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:24:17,261 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-23 05:24:17,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-23 05:24:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-23 05:24:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 05:24:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-23 05:24:17,263 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 05:24:17,263 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 05:24:17,263 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 05:24:17,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-23 05:24:17,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:24:17,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:24:17,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:24:17,264 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:24:17,264 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:24:17,265 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 360#L382 assume !(main_~length1~0 < 1); 361#L382-2 assume !(main_~length2~0 < 1); 358#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 354#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 355#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 368#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 364#L372-1 assume !cstrcspn_#t~short210; 365#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 350#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 351#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 352#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 353#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 357#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 367#L372-5 [2018-11-23 05:24:17,265 INFO L796 eck$LassoCheckResult]: Loop: 367#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 362#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 363#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 367#L372-5 [2018-11-23 05:24:17,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:17,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-23 05:24:17,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:24:17,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:24:17,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:17,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:24:17,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:17,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:17,287 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-23 05:24:17,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:24:17,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:24:17,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:17,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:24:17,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:17,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:17,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2018-11-23 05:24:17,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:24:17,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:24:17,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:17,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:24:17,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:24:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:24:17,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:24:17,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce44c97-68b2-4da0-91db-cbfcb2e49338/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:24:17,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:24:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:24:17,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:24:17,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-11-23 05:24:17,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 05:24:17,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:24:17,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-11-23 05:24:17,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 05:24:17,504 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:24:17,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-23 05:24:17,518 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:24:17,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:24:17,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:24:17,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-23 05:24:17,536 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-11-23 05:24:55,619 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 05:25:21,515 WARN L180 SmtUtils]: Spent 1.88 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 05:25:37,223 WARN L180 SmtUtils]: Spent 2.34 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 05:25:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:25:37,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:25:37,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-23 05:25:37,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 05:25:37,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=116, Unknown=7, NotChecked=0, Total=156 [2018-11-23 05:25:37,345 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-11-23 05:25:39,741 WARN L180 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-11-23 05:25:42,382 WARN L180 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2018-11-23 05:25:44,921 WARN L180 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-11-23 05:25:44,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:25:44,957 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-11-23 05:25:44,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:25:44,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2018-11-23 05:25:44,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:25:44,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2018-11-23 05:25:44,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 05:25:44,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 05:25:44,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2018-11-23 05:25:44,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:25:44,960 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-23 05:25:44,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2018-11-23 05:25:44,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-11-23 05:25:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 05:25:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-11-23 05:25:44,962 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-23 05:25:44,962 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-23 05:25:44,962 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 05:25:44,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-11-23 05:25:44,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:25:44,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:25:44,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:25:44,963 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:25:44,963 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:25:44,963 INFO L794 eck$LassoCheckResult]: Stem: 527#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 520#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 521#L382 assume !(main_~length1~0 < 1); 522#L382-2 assume !(main_~length2~0 < 1); 519#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 515#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 516#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 535#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 525#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 526#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 511#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 512#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 513#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 514#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 518#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 528#L372-5 [2018-11-23 05:25:44,963 INFO L796 eck$LassoCheckResult]: Loop: 528#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 523#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 524#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 528#L372-5 [2018-11-23 05:25:44,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:25:44,963 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-23 05:25:44,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:25:44,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:25:44,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:25:44,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:25:44,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:25:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:25:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:25:44,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:25:44,982 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-23 05:25:44,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:25:44,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:25:44,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:25:44,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:25:44,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:25:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:25:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:25:44,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:25:44,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-23 05:25:44,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:25:44,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:25:44,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:25:44,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:25:44,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:25:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:25:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:25:45,550 WARN L180 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 132 [2018-11-23 05:25:46,121 WARN L180 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2018-11-23 05:25:46,123 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:25:46,123 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:25:46,123 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:25:46,123 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:25:46,123 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:25:46,123 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:25:46,123 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:25:46,123 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:25:46,123 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_malloc_true-termination.c.i_Iteration5_Lasso [2018-11-23 05:25:46,123 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:25:46,124 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:25:46,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,293 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 05:25:46,665 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2018-11-23 05:25:46,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:46,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:25:47,426 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-11-23 05:25:47,523 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:25:47,523 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:25:47,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:25:47,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:25:47,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:25:47,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:25:47,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:25:47,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:25:47,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:25:47,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:25:47,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:25:47,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:25:47,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:25:47,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:25:47,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:25:47,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:25:47,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:25:47,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:25:47,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:25:47,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:25:47,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:25:47,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:25:47,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:25:47,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:25:47,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:25:47,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:25:47,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:25:47,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:25:47,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:25:47,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:25:47,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:25:47,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:25:47,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:25:47,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:25:47,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:25:47,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:25:47,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:25:47,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:25:47,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:25:47,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:25:47,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:25:47,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:25:47,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:25:47,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:25:47,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:25:47,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:25:47,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:25:47,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:25:47,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:25:47,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:25:47,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:25:47,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:25:47,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:25:47,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:25:47,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:25:47,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:25:47,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:25:47,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:25:47,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:25:47,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:25:47,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:25:47,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:25:47,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:25:47,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:25:47,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:25:47,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:25:47,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:25:47,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:25:47,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:25:47,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:25:47,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:25:47,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:25:47,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:25:47,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:25:47,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:25:47,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:25:47,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:25:47,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:25:47,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:25:47,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:25:47,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:25:47,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:25:47,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:25:47,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:25:47,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:25:47,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:25:47,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:25:47,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:25:47,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:25:47,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:25:47,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:25:47,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:25:47,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:25:47,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:25:47,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:25:47,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:25:47,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:25:47,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:25:47,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:25:47,551 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:25:47,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:25:47,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:25:47,552 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:25:47,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:25:47,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:25:47,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:25:47,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:25:47,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:25:47,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:25:47,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:25:47,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:25:47,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:25:47,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:25:47,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:25:47,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:25:47,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:25:47,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:25:47,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:25:47,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:25:47,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:25:47,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:25:47,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:25:47,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:25:47,564 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:25:47,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:25:47,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:25:47,565 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:25:47,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:25:47,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:25:47,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:25:47,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:25:47,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:25:47,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:25:47,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:25:47,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:25:47,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:25:47,592 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:25:47,609 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 05:25:47,609 INFO L444 ModelExtractionUtils]: 45 out of 52 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 05:25:47,610 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:25:47,610 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:25:47,610 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:25:47,610 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-23 05:25:47,731 INFO L297 tatePredicateManager]: 30 out of 31 supporting invariants were superfluous and have been removed [2018-11-23 05:25:47,733 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 05:25:47,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:25:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:25:47,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:25:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:25:47,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:25:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:25:47,783 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 05:25:47,784 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 05:25:47,810 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2018-11-23 05:25:47,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 05:25:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 05:25:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 05:25:47,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 05:25:47,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:25:47,811 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 05:25:47,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:25:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:25:47,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:25:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:25:47,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:25:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:25:47,855 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 05:25:47,855 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 05:25:47,875 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2018-11-23 05:25:47,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 05:25:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 05:25:47,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 05:25:47,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 05:25:47,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:25:47,876 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 05:25:47,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:25:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:25:47,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:25:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:25:47,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:25:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:25:47,916 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 05:25:47,916 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 05:25:47,937 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 45 states and 60 transitions. Complement of second has 5 states. [2018-11-23 05:25:47,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 05:25:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 05:25:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 05:25:47,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 05:25:47,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:25:47,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 05:25:47,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:25:47,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 05:25:47,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:25:47,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2018-11-23 05:25:47,940 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:25:47,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2018-11-23 05:25:47,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 05:25:47,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 05:25:47,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 05:25:47,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:25:47,941 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:25:47,941 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:25:47,941 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:25:47,941 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 05:25:47,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:25:47,941 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:25:47,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 05:25:47,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 05:25:47 BoogieIcfgContainer [2018-11-23 05:25:47,946 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 05:25:47,947 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:25:47,947 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:25:47,947 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:25:47,947 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:24:13" (3/4) ... [2018-11-23 05:25:47,950 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:25:47,950 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:25:47,951 INFO L168 Benchmark]: Toolchain (without parser) took 94823.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 246.9 MB). Free memory was 956.6 MB in the beginning and 983.3 MB in the end (delta: -26.7 MB). Peak memory consumption was 220.2 MB. Max. memory is 11.5 GB. [2018-11-23 05:25:47,951 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:25:47,952 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -155.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2018-11-23 05:25:47,952 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:25:47,953 INFO L168 Benchmark]: Boogie Preprocessor took 16.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:25:47,953 INFO L168 Benchmark]: RCFGBuilder took 203.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:25:47,954 INFO L168 Benchmark]: BuchiAutomizer took 94213.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.2 MB). Free memory was 1.1 GB in the beginning and 983.3 MB in the end (delta: 100.7 MB). Peak memory consumption was 223.9 MB. Max. memory is 11.5 GB. [2018-11-23 05:25:47,954 INFO L168 Benchmark]: Witness Printer took 3.44 ms. Allocated memory is still 1.3 GB. Free memory is still 983.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:25:47,957 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -155.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 203.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 94213.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.2 MB). Free memory was 1.1 GB in the beginning and 983.3 MB in the end (delta: 100.7 MB). Peak memory consumption was 223.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.44 ms. Allocated memory is still 1.3 GB. Free memory is still 983.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[malloc(length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 94.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 85.9s. Construction of modules took 0.1s. Büchi inclusion checks took 7.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 103 SDtfs, 164 SDslu, 93 SDs, 0 SdLazy, 151 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital372 mio100 ax100 hnf99 lsp91 ukn71 mio100 lsp33 div131 bol100 ite100 ukn100 eq167 hnf77 smp88 dnf1052 smp24 tf100 neg95 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 103ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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...