./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca_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_309989d4-d97c-4898-979b-106978c2e550/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_309989d4-d97c-4898-979b-106978c2e550/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_309989d4-d97c-4898-979b-106978c2e550/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_309989d4-d97c-4898-979b-106978c2e550/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_309989d4-d97c-4898-979b-106978c2e550/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_309989d4-d97c-4898-979b-106978c2e550/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 54ff0e2671f1fbdd267f9aba90cfe8fb60d3ccde ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:54:48,427 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:54:48,428 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:54:48,435 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:54:48,436 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:54:48,436 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:54:48,437 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:54:48,438 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:54:48,439 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:54:48,440 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:54:48,440 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:54:48,441 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:54:48,441 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:54:48,442 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:54:48,443 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:54:48,443 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:54:48,444 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:54:48,445 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:54:48,446 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:54:48,447 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:54:48,448 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:54:48,449 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:54:48,450 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:54:48,451 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:54:48,451 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:54:48,451 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:54:48,452 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:54:48,453 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:54:48,453 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:54:48,454 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:54:48,454 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:54:48,455 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:54:48,455 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:54:48,455 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:54:48,456 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:54:48,456 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:54:48,457 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_309989d4-d97c-4898-979b-106978c2e550/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 12:54:48,468 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:54:48,468 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:54:48,468 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:54:48,469 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:54:48,469 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:54:48,469 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 12:54:48,469 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 12:54:48,469 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 12:54:48,469 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 12:54:48,470 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 12:54:48,470 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 12:54:48,470 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:54:48,470 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 12:54:48,470 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:54:48,470 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:54:48,470 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 12:54:48,471 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 12:54:48,471 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 12:54:48,471 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:54:48,471 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 12:54:48,471 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:54:48,471 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 12:54:48,471 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:54:48,472 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:54:48,472 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 12:54:48,472 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:54:48,472 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:54:48,472 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 12:54:48,473 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 12:54:48,473 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_309989d4-d97c-4898-979b-106978c2e550/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 -> 54ff0e2671f1fbdd267f9aba90cfe8fb60d3ccde [2018-11-23 12:54:48,496 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:54:48,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:54:48,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:54:48,506 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:54:48,507 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:54:48,507 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_309989d4-d97c-4898-979b-106978c2e550/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca_true-termination.c.i [2018-11-23 12:54:48,542 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_309989d4-d97c-4898-979b-106978c2e550/bin-2019/uautomizer/data/2aff34ae7/36df9495e52b440fb457716ed6526818/FLAGc82ada60b [2018-11-23 12:54:48,990 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:54:48,991 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_309989d4-d97c-4898-979b-106978c2e550/sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca_true-termination.c.i [2018-11-23 12:54:48,999 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_309989d4-d97c-4898-979b-106978c2e550/bin-2019/uautomizer/data/2aff34ae7/36df9495e52b440fb457716ed6526818/FLAGc82ada60b [2018-11-23 12:54:49,007 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_309989d4-d97c-4898-979b-106978c2e550/bin-2019/uautomizer/data/2aff34ae7/36df9495e52b440fb457716ed6526818 [2018-11-23 12:54:49,010 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:54:49,011 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:54:49,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:49,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:54:49,015 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:54:49,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:49" (1/1) ... [2018-11-23 12:54:49,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8308fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:49, skipping insertion in model container [2018-11-23 12:54:49,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:49" (1/1) ... [2018-11-23 12:54:49,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:54:49,057 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:54:49,247 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:49,255 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:54:49,325 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:49,347 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:54:49,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:49 WrapperNode [2018-11-23 12:54:49,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:49,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:49,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:54:49,348 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:54:49,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:49" (1/1) ... [2018-11-23 12:54:49,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:49" (1/1) ... [2018-11-23 12:54:49,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:49,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:54:49,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:54:49,378 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:54:49,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:49" (1/1) ... [2018-11-23 12:54:49,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:49" (1/1) ... [2018-11-23 12:54:49,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:49" (1/1) ... [2018-11-23 12:54:49,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:49" (1/1) ... [2018-11-23 12:54:49,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:49" (1/1) ... [2018-11-23 12:54:49,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:49" (1/1) ... [2018-11-23 12:54:49,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:49" (1/1) ... [2018-11-23 12:54:49,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:54:49,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:54:49,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:54:49,396 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:54:49,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_309989d4-d97c-4898-979b-106978c2e550/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 12:54:49,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:54:49,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:54:49,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:54:49,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:54:49,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:54:49,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:54:49,632 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:54:49,632 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 12:54:49,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:49 BoogieIcfgContainer [2018-11-23 12:54:49,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:54:49,633 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 12:54:49,633 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 12:54:49,636 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 12:54:49,636 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:54:49,637 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:54:49" (1/3) ... [2018-11-23 12:54:49,637 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@91a6f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:54:49, skipping insertion in model container [2018-11-23 12:54:49,638 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:54:49,638 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:49" (2/3) ... [2018-11-23 12:54:49,638 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@91a6f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:54:49, skipping insertion in model container [2018-11-23 12:54:49,638 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:54:49,638 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:49" (3/3) ... [2018-11-23 12:54:49,640 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca_true-termination.c.i [2018-11-23 12:54:49,677 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:54:49,677 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 12:54:49,678 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 12:54:49,678 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 12:54:49,678 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:54:49,678 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:54:49,678 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 12:54:49,678 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:54:49,678 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 12:54:49,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 12:54:49,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 12:54:49,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:54:49,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:54:49,711 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 12:54:49,711 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 12:54:49,711 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 12:54:49,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 12:54:49,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 12:54:49,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:54:49,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:54:49,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 12:54:49,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 12:54:49,720 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 7#L565true assume !(main_~length1~0 < 1); 12#L565-2true assume !(main_~length2~0 < 1); 6#L568-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, 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; 3#L552-4true [2018-11-23 12:54:49,720 INFO L796 eck$LassoCheckResult]: Loop: 3#L552-4true call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 14#L552-1true assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 16#L555-5true assume !true; 19#L555-6true call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 5#L557true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 20#L552-3true cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 3#L552-4true [2018-11-23 12:54:49,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:49,724 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 12:54:49,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:49,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:49,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:49,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:49,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:49,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:49,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-23 12:54:49,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:49,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:49,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:49,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:49,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:49,843 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 12:54:49,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:49,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:54:49,847 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 12:54:49,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:54:49,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:54:49,858 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 12:54:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:49,862 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 12:54:49,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:54:49,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-23 12:54:49,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 12:54:49,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-23 12:54:49,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 12:54:49,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 12:54:49,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-23 12:54:49,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:54:49,871 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 12:54:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-23 12:54:49,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 12:54:49,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:54:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-23 12:54:49,890 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 12:54:49,890 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 12:54:49,890 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 12:54:49,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-23 12:54:49,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 12:54:49,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:54:49,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:54:49,892 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 12:54:49,892 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:49,892 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 49#L565 assume !(main_~length1~0 < 1); 50#L565-2 assume !(main_~length2~0 < 1); 48#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, 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; 44#L552-4 [2018-11-23 12:54:49,892 INFO L796 eck$LassoCheckResult]: Loop: 44#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 45#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 56#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 51#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 52#L555-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5; 55#L555-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 46#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 47#L552-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 44#L552-4 [2018-11-23 12:54:49,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:49,892 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 12:54:49,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:49,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:49,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:49,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:49,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:49,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:49,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-23 12:54:49,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:49,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:49,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:49,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:49,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:49,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:49,944 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-23 12:54:49,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:49,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:49,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:49,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:49,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:50,149 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-23 12:54:50,309 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-23 12:54:50,474 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-23 12:54:50,566 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:54:50,567 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:54:50,567 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:54:50,567 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:54:50,568 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:54:50,568 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:54:50,568 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:54:50,568 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:54:50,568 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 12:54:50,568 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:54:50,568 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:54:50,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:50,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:50,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:50,591 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 12:54:50,593 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 12:54:50,594 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 12:54:50,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:50,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:50,873 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 12:54:50,875 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 12:54:50,876 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 12:54:50,877 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 12:54:50,879 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 12:54:50,881 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 12:54:50,883 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 12:54:50,887 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 12:54:50,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:50,892 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 12:54:50,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:50,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:50,895 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 12:54:51,226 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2018-11-23 12:54:51,352 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:54:51,356 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:54:51,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:51,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:54:51,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:51,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:54:51,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:54:51,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:51,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:54:51,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:51,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:54:51,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:54:51,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:51,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:51,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:54:51,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:51,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:51,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:54:51,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:51,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:54:51,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:54:51,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:51,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:54:51,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:51,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:54:51,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:54:51,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:51,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:54:51,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:51,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:54:51,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:54:51,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:54:51,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:51,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:54:51,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:51,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:51,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:51,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:54:51,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:51,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:54:51,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:51,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:54:51,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:51,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:51,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:54:51,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:51,401 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 12:54:51,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,404 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:54:51,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:54:51,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:51,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:51,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:54:51,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:51,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:51,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,422 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:54:51,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,424 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:54:51,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:51,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:51,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:51,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:54:51,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:51,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:54:51,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:54:51,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:51,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:54:51,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:54:51,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,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 12:54:51,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:51,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:54:51,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:51,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:51,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,454 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:54:51,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,456 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:54:51,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:51,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:51,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:51,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:54:51,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:51,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:51,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:51,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:51,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:51,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:51,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:51,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:54:51,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:51,487 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:54:51,508 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 12:54:51,508 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 12:54:51,510 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:54:51,511 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:54:51,511 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:54:51,512 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2018-11-23 12:54:51,550 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 12:54:51,558 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 12:54:51,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:51,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:51,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:51,638 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 12:54:51,642 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 12:54:51,643 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 12:54:51,698 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 12:54:51,699 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 12:54:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:54:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-23 12:54:51,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 12:54:51,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:54:51,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-23 12:54:51,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:54:51,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-23 12:54:51,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:54:51,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-23 12:54:51,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:54:51,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-23 12:54:51,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 12:54:51,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 12:54:51,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-23 12:54:51,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:54:51,707 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 12:54:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-23 12:54:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 12:54:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:54:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-23 12:54:51,708 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 12:54:51,708 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 12:54:51,709 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 12:54:51,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-23 12:54:51,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:54:51,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:54:51,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:54:51,710 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:51,710 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:54:51,710 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 191#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 185#L565 assume !(main_~length1~0 < 1); 186#L565-2 assume !(main_~length2~0 < 1); 184#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, 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; 178#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 180#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 193#L555-5 [2018-11-23 12:54:51,710 INFO L796 eck$LassoCheckResult]: Loop: 193#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 187#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 188#L555-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 193#L555-5 [2018-11-23 12:54:51,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:51,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-23 12:54:51,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:51,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:51,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:51,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:51,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:51,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:51,729 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-23 12:54:51,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:51,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:51,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:51,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:51,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:51,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:51,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-23 12:54:51,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:51,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:51,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:51,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:51,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:52,063 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-11-23 12:54:52,125 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:54:52,125 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:54:52,126 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:54:52,126 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:54:52,126 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:54:52,126 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:54:52,126 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:54:52,126 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:54:52,126 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 12:54:52,126 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:54:52,126 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:54:52,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:52,135 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 12:54:52,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:52,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 12:54:52,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 12:54:52,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:52,142 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 12:54:52,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 12:54:52,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 12:54:52,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:52,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:52,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:52,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:52,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:52,369 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 12:54:52,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:52,371 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 12:54:52,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:54:52,374 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 12:54:52,375 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 12:54:52,377 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 12:54:52,733 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-23 12:54:52,780 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:54:52,780 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:54:52,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:52,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:52,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:54:52,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:52,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:52,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:52,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:54:52,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:54:52,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:52,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:52,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:52,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:54:52,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:52,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:52,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:52,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:54:52,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:54:52,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:52,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:52,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:52,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:54:52,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:52,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:52,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:52,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:54:52,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:54:52,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:52,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:54:52,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:52,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:54:52,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:52,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:52,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:52,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:54:52,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:54:52,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:52,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:52,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:52,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:54:52,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:52,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:52,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:52,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:54:52,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:54:52,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:52,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:52,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:52,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:52,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:52,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:52,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:54:52,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:52,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:52,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:54:52,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:52,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:52,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:52,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:52,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:54:52,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:52,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:52,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:54:52,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:52,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:54:52,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:52,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:52,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:52,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:54:52,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:54:52,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:52,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:52,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:52,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:52,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:52,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:52,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:54:52,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:52,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:52,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:54:52,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:52,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:52,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:52,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:52,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:54:52,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:52,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:52,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:54:52,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:52,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:52,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:52,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:52,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:54:52,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:52,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:52,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:54:52,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:52,814 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:54:52,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:52,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:52,832 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:54:52,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:52,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:54:52,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:54:52,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:54:52,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:54:52,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:54:52,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:54:52,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:54:52,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:54:52,854 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:54:52,864 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 12:54:52,864 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 12:54:52,864 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:54:52,865 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:54:52,865 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:54:52,865 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-23 12:54:52,908 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-23 12:54:52,910 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 12:54:52,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:52,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:52,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:52,979 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 12:54:52,979 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 12:54:52,979 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 12:54:53,023 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-11-23 12:54:53,024 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 12:54:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:54:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 12:54:53,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 12:54:53,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:54:53,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 12:54:53,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:54:53,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 12:54:53,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:54:53,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-23 12:54:53,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:54:53,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-23 12:54:53,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 12:54:53,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 12:54:53,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-23 12:54:53,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:54:53,027 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-23 12:54:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-23 12:54:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-23 12:54:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:54:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-23 12:54:53,030 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 12:54:53,030 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 12:54:53,030 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 12:54:53,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-23 12:54:53,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:54:53,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:54:53,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:54:53,031 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:53,031 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:54:53,033 INFO L794 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 358#L565 assume !(main_~length1~0 < 1); 359#L565-2 assume !(main_~length2~0 < 1); 357#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, 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; 350#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 351#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 367#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 372#L555-1 assume !cstrcspn_#t~short7; 371#L555-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5; 370#L555-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 355#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 356#L552-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 352#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 354#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 366#L555-5 [2018-11-23 12:54:53,033 INFO L796 eck$LassoCheckResult]: Loop: 366#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 360#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 361#L555-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 366#L555-5 [2018-11-23 12:54:53,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:53,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-23 12:54:53,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:53,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:53,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:53,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:53,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:53,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:53,052 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-23 12:54:53,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:53,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:53,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:53,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:53,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:53,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:53,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2018-11-23 12:54:53,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:53,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:53,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:53,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:53,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:53,130 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 12:54:53,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:53,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_309989d4-d97c-4898-979b-106978c2e550/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 12:54:53,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:53,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:53,185 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 12:54:53,188 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 12:54:53,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:53,234 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 12:54:53,244 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 12:54:53,244 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:53,263 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 12:54:53,263 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:53,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:53,276 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 12:54:53,281 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 12:54:53,282 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-11-23 12:55:27,401 WARN L180 SmtUtils]: Spent 945.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 12:55:52,781 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 12:56:07,808 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 12:56:07,813 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 12:56:07,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:07,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-23 12:56:07,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:56:07,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=116, Unknown=7, NotChecked=0, Total=156 [2018-11-23 12:56:07,936 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-11-23 12:56:11,025 WARN L180 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2018-11-23 12:56:13,185 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-11-23 12:56:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:13,230 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-11-23 12:56:13,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:56:13,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2018-11-23 12:56:13,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:56:13,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2018-11-23 12:56:13,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 12:56:13,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 12:56:13,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2018-11-23 12:56:13,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 12:56:13,234 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-23 12:56:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2018-11-23 12:56:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-11-23 12:56:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:56:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-11-23 12:56:13,236 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-23 12:56:13,236 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-23 12:56:13,237 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 12:56:13,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-11-23 12:56:13,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 12:56:13,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:56:13,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:56:13,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:13,238 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:56:13,238 INFO L794 eck$LassoCheckResult]: Stem: 526#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 525#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 519#L565 assume !(main_~length1~0 < 1); 520#L565-2 assume !(main_~length2~0 < 1); 518#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, 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; 511#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 512#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 530#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 523#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 524#L555-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5; 533#L555-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 516#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 517#L552-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 513#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 515#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 527#L555-5 [2018-11-23 12:56:13,238 INFO L796 eck$LassoCheckResult]: Loop: 527#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 521#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 522#L555-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 527#L555-5 [2018-11-23 12:56:13,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:13,238 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-23 12:56:13,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:13,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:13,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:13,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:13,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:13,262 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-23 12:56:13,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:13,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:13,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:56:13,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:13,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:13,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-23 12:56:13,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:13,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:13,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:56:13,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:13,748 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 133 [2018-11-23 12:56:14,267 WARN L180 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2018-11-23 12:56:14,269 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:56:14,269 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:56:14,269 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:56:14,269 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:56:14,269 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:56:14,269 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:56:14,269 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:56:14,270 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:56:14,270 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 12:56:14,270 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:56:14,270 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:56:14,277 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 12:56:14,279 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 12:56:14,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 12:56:14,286 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 12:56:14,287 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 12:56:14,293 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 12:56:14,294 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 12:56:14,295 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 12:56:14,438 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 12:56:14,860 WARN L180 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2018-11-23 12:56: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 12:56: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 12:56:14,950 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 12:56:14,951 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 12:56:14,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:14,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:14,954 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 12:56:14,955 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 12:56:14,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:14,957 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 12:56:14,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:14,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:14,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:14,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:15,634 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-11-23 12:56:15,740 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:56:15,741 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:56:15,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:56:15,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:15,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:56:15,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:15,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:15,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:15,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:56:15,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:56:15,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:15,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:56:15,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:15,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:56:15,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:15,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:15,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:15,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:56:15,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:56:15,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:15,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:56:15,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:15,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:15,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:15,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:15,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:56:15,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:56:15,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:15,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:56:15,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:15,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:56:15,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:15,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:15,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:15,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:56:15,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:56:15,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:15,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:56:15,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:15,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:56:15,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:15,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:15,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:15,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:56:15,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:56:15,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:15,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:56:15,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:15,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:56:15,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:15,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:15,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:15,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:56:15,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:56:15,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:15,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:56:15,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:15,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:15,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:15,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:15,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:56:15,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:56:15,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:15,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 12:56:15,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:15,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:15,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:15,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:15,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:56:15,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:56:15,770 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:56:15,787 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 12:56:15,787 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 12:56:15,787 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:56:15,788 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:56:15,788 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:56:15,788 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-23 12:56:15,925 INFO L297 tatePredicateManager]: 33 out of 33 supporting invariants were superfluous and have been removed [2018-11-23 12:56:15,926 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 12:56:15,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:15,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:15,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:15,966 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 12:56:15,966 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 12:56:15,966 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 12:56:15,982 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2018-11-23 12:56:15,983 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 12:56:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:56:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 12:56:15,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 12:56:15,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:56:15,984 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 12:56:15,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:16,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:16,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:16,010 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 12:56:16,010 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 12:56:16,010 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 12:56:16,019 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2018-11-23 12:56:16,022 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 12:56:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:56:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 12:56:16,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 12:56:16,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:56:16,023 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 12:56:16,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:16,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:16,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:16,049 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 12:56:16,049 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 12:56:16,050 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 12:56:16,061 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 45 states and 60 transitions. Complement of second has 4 states. [2018-11-23 12:56:16,062 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 12:56:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:56:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-11-23 12:56:16,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 12:56:16,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:56:16,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 12:56:16,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:56:16,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 12:56:16,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:56:16,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2018-11-23 12:56:16,064 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:56:16,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2018-11-23 12:56:16,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 12:56:16,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 12:56:16,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 12:56:16,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:56:16,064 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:56:16,064 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:56:16,064 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:56:16,064 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 12:56:16,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:56:16,064 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:56:16,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 12:56:16,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:56:16 BoogieIcfgContainer [2018-11-23 12:56:16,068 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 12:56:16,069 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:56:16,069 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:56:16,069 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:56:16,069 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:49" (3/4) ... [2018-11-23 12:56:16,071 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 12:56:16,071 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:56:16,072 INFO L168 Benchmark]: Toolchain (without parser) took 87061.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 362.3 MB). Free memory was 956.4 MB in the beginning and 1.3 GB in the end (delta: -343.1 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2018-11-23 12:56:16,072 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:56:16,073 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:56:16,073 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:56:16,073 INFO L168 Benchmark]: Boogie Preprocessor took 17.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:56:16,073 INFO L168 Benchmark]: RCFGBuilder took 236.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:56:16,074 INFO L168 Benchmark]: BuchiAutomizer took 86435.75 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 248.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -225.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-11-23 12:56:16,074 INFO L168 Benchmark]: Witness Printer took 2.61 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:56:16,076 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 236.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 86435.75 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 248.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -225.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.61 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 86.4s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 80.5s. Construction of modules took 0.1s. Büchi inclusion checks took 5.5s. 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: 105 SDtfs, 145 SDslu, 83 SDs, 0 SdLazy, 148 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital371 mio100 ax105 hnf99 lsp86 ukn71 mio100 lsp30 div137 bol100 ite100 ukn100 eq160 hnf77 smp91 dnf1075 smp24 tf100 neg95 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 0 MotzkinApplications: 8 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...