./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 022e5e55adeb2213dd3e7a54e30f105429bff667 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:57:10,401 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:57:10,403 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:57:10,420 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:57:10,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:57:10,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:57:10,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:57:10,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:57:10,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:57:10,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:57:10,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:57:10,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:57:10,430 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:57:10,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:57:10,432 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:57:10,433 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:57:10,434 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:57:10,436 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:57:10,438 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:57:10,440 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:57:10,441 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:57:10,442 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:57:10,445 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:57:10,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:57:10,445 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:57:10,446 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:57:10,448 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:57:10,448 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:57:10,449 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:57:10,451 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:57:10,451 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:57:10,452 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:57:10,452 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:57:10,453 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:57:10,454 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:57:10,455 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:57:10,455 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:57:10,473 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:57:10,473 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:57:10,476 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:57:10,476 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:57:10,476 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:57:10,476 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:57:10,476 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:57:10,477 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:57:10,477 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:57:10,477 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:57:10,477 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:57:10,477 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:57:10,477 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:57:10,478 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:57:10,479 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:57:10,479 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:57:10,479 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:57:10,480 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:57:10,481 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:57:10,481 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:57:10,481 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:57:10,481 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:57:10,481 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:57:10,481 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:57:10,482 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:57:10,482 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:57:10,482 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:57:10,482 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:57:10,482 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:57:10,483 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:57:10,484 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:57:10,485 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:57:10,485 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 022e5e55adeb2213dd3e7a54e30f105429bff667 [2019-01-14 04:57:10,551 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:57:10,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:57:10,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:57:10,575 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:57:10,575 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:57:10,576 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:10,630 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22325fff9/dfcaf7f86da6428f814a08e15c5d83cc/FLAG12ec2fae3 [2019-01-14 04:57:11,136 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:57:11,137 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:11,154 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22325fff9/dfcaf7f86da6428f814a08e15c5d83cc/FLAG12ec2fae3 [2019-01-14 04:57:11,432 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22325fff9/dfcaf7f86da6428f814a08e15c5d83cc [2019-01-14 04:57:11,436 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:57:11,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:57:11,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:11,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:57:11,442 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:57:11,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:11" (1/1) ... [2019-01-14 04:57:11,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d822aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:11, skipping insertion in model container [2019-01-14 04:57:11,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:11" (1/1) ... [2019-01-14 04:57:11,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:57:11,495 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:57:11,884 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:11,899 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:57:12,026 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:12,079 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:57:12,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:12 WrapperNode [2019-01-14 04:57:12,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:12,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:12,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:57:12,081 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:57:12,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:12" (1/1) ... [2019-01-14 04:57:12,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:12" (1/1) ... [2019-01-14 04:57:12,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:12,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:57:12,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:57:12,138 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:57:12,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:12" (1/1) ... [2019-01-14 04:57:12,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:12" (1/1) ... [2019-01-14 04:57:12,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:12" (1/1) ... [2019-01-14 04:57:12,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:12" (1/1) ... [2019-01-14 04:57:12,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:12" (1/1) ... [2019-01-14 04:57:12,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:12" (1/1) ... [2019-01-14 04:57:12,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:12" (1/1) ... [2019-01-14 04:57:12,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:57:12,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:57:12,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:57:12,190 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:57:12,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:57:12,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:57:12,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:57:12,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:57:12,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:57:12,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:57:12,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:57:12,708 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:57:12,708 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 04:57:12,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:12 BoogieIcfgContainer [2019-01-14 04:57:12,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:57:12,711 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:57:12,711 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:57:12,714 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:57:12,715 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:12,716 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:57:11" (1/3) ... [2019-01-14 04:57:12,717 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53907b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:12, skipping insertion in model container [2019-01-14 04:57:12,717 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:12,717 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:12" (2/3) ... [2019-01-14 04:57:12,717 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53907b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:12, skipping insertion in model container [2019-01-14 04:57:12,718 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:12,718 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:12" (3/3) ... [2019-01-14 04:57:12,719 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:12,776 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:57:12,777 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:57:12,777 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:57:12,777 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:57:12,778 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:57:12,778 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:57:12,778 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:57:12,778 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:57:12,778 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:57:12,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 04:57:12,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 04:57:12,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:12,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:12,825 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:12,826 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:57:12,826 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:57:12,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 04:57:12,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 04:57:12,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:12,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:12,829 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:12,829 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:57:12,837 INFO L794 eck$LassoCheckResult]: Stem: 14#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; 3#L558true assume !(main_~length1~0 < 1); 6#L558-2true assume !(main_~length2~0 < 1); 19#L561-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(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.allocOnStack(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; 15#L545-4true [2019-01-14 04:57:12,838 INFO L796 eck$LassoCheckResult]: Loop: 15#L545-4true call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 8#L545-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; 9#L548-5true assume !true; 12#L548-6true call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 18#L550true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 13#L545-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; 15#L545-4true [2019-01-14 04:57:12,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:12,849 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 04:57:12,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:12,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:12,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:12,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:12,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:13,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:13,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-01-14 04:57:13,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:13,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:13,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:13,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:13,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:13,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:57:13,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:57:13,055 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:57:13,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 04:57:13,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 04:57:13,071 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-14 04:57:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:57:13,078 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-14 04:57:13,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:57:13,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-14 04:57:13,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 04:57:13,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-01-14 04:57:13,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 04:57:13,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 04:57:13,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-14 04:57:13,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:13,092 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 04:57:13,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-14 04:57:13,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 04:57:13,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 04:57:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-14 04:57:13,122 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 04:57:13,122 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 04:57:13,122 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:57:13,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-14 04:57:13,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 04:57:13,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:13,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:13,124 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:13,124 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:13,124 INFO L794 eck$LassoCheckResult]: Stem: 56#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 52#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; 44#L558 assume !(main_~length1~0 < 1); 45#L558-2 assume !(main_~length2~0 < 1); 48#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(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.allocOnStack(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; 55#L545-4 [2019-01-14 04:57:13,125 INFO L796 eck$LassoCheckResult]: Loop: 55#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 51#L545-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; 50#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 46#L548-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); 47#L548-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 49#L548-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 53#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 54#L545-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; 55#L545-4 [2019-01-14 04:57:13,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:13,125 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-14 04:57:13,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:13,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:13,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:13,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:13,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:13,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:13,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-01-14 04:57:13,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:13,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:13,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:13,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:13,202 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-01-14 04:57:13,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:13,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:13,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:13,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:13,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:13,966 WARN L181 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-01-14 04:57:14,753 WARN L181 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-01-14 04:57:15,154 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-14 04:57:15,296 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 04:57:15,307 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:15,308 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:15,309 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:15,309 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:15,309 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:15,309 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:15,309 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:15,310 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:15,310 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-14 04:57:15,310 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:15,310 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:15,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:15,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:15,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:15,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:15,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:15,789 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-01-14 04:57:16,119 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-01-14 04:57:16,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:16,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:16,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:16,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:16,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:16,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:16,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:16,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:16,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:16,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:16,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:16,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:16,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:17,003 WARN L181 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-14 04:57:17,135 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 04:57:17,552 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-01-14 04:57:17,743 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:17,751 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:17,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 [2019-01-14 04:57:17,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:17,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:17,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:17,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:17,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:17,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:17,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:17,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:17,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:17,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:17,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:17,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:17,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:17,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:17,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:17,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:17,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:17,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:17,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:17,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:17,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:17,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:17,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:17,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:17,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:17,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:17,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:17,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:17,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:17,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:17,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:17,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:17,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:17,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:17,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:17,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:17,778 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 04:57:17,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:17,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:17,791 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:57:17,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:17,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:17,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:17,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:17,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:17,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:17,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:17,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:17,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:17,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:17,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:17,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:17,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:17,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:17,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:17,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:17,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:17,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:17,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:17,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:17,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:17,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:17,917 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2019-01-14 04:57:17,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:17,922 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:57:17,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:17,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:17,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:17,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:17,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:17,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:17,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:17,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:17,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:17,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:17,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:17,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:17,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:17,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:17,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:17,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:17,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:17,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:17,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:17,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:17,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:17,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:17,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:17,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:17,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:17,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:17,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:17,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:17,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:17,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:17,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:17,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:17,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:17,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:17,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:17,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:17,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:17,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:17,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:17,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:18,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:18,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:18,036 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:18,069 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:57:18,070 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:57:18,072 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:18,074 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:18,078 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:18,079 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 [] [2019-01-14 04:57:18,145 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 04:57:18,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:57:18,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:18,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:18,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:18,287 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 [2019-01-14 04:57:18,288 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 04:57:18,397 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. [2019-01-14 04:57:18,399 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 [2019-01-14 04:57:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-14 04:57:18,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-14 04:57:18,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:18,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-01-14 04:57:18,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:18,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-01-14 04:57:18,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:18,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-14 04:57:18,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:18,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-01-14 04:57:18,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 04:57:18,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 04:57:18,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-14 04:57:18,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:57:18,407 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 04:57:18,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-14 04:57:18,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-14 04:57:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 04:57:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-14 04:57:18,410 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 04:57:18,410 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 04:57:18,410 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:57:18,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-14 04:57:18,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:18,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:18,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:18,411 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:18,412 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:18,412 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#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; 178#L558 assume !(main_~length1~0 < 1); 179#L558-2 assume !(main_~length2~0 < 1); 184#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(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.allocOnStack(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; 195#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 188#L545-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; 185#L548-5 [2019-01-14 04:57:18,412 INFO L796 eck$LassoCheckResult]: Loop: 185#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 180#L548-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); 181#L548-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;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; 185#L548-5 [2019-01-14 04:57:18,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:18,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-01-14 04:57:18,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:18,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:18,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:18,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:18,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:18,440 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-01-14 04:57:18,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:18,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:18,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:18,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:18,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:18,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:18,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-01-14 04:57:18,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:18,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:18,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:18,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:18,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:18,637 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-14 04:57:18,776 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 04:57:19,123 WARN L181 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-01-14 04:57:19,338 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-01-14 04:57:19,342 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:19,342 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:19,342 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:19,342 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:19,342 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:19,342 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:19,342 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:19,342 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:19,343 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-14 04:57:19,343 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:19,343 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:19,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,815 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-01-14 04:57:19,972 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-14 04:57:19,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:19,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:57:20,644 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 04:57:21,283 WARN L181 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 04:57:21,319 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:21,319 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:21,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:21,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:21,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:21,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:21,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:21,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:21,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:21,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:21,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:21,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:21,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:21,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:21,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:21,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:21,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:21,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:21,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:21,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:21,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:21,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:21,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:21,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:21,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:21,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:21,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:21,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:21,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:21,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:21,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:21,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:21,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:21,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:21,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:21,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:21,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:21,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:21,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:21,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:21,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:21,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:21,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:21,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:21,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:21,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:21,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,427 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:57:21,427 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-14 04:57:21,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,465 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-01-14 04:57:21,467 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-14 04:57:21,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:21,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:21,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:21,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:21,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:21,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:21,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:21,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:21,620 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:21,637 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:57:21,637 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:57:21,637 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:21,639 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:21,640 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:21,640 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 [] [2019-01-14 04:57:21,789 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-01-14 04:57:21,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:57:21,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:21,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:21,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:21,995 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 [2019-01-14 04:57:21,996 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-14 04:57:22,117 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. [2019-01-14 04:57:22,119 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 [2019-01-14 04:57:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:57:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 04:57:22,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 04:57:22,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:22,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-14 04:57:22,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:22,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-14 04:57:22,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:22,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-01-14 04:57:22,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:22,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-01-14 04:57:22,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 04:57:22,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 04:57:22,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-01-14 04:57:22,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:57:22,125 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-01-14 04:57:22,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-01-14 04:57:22,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-14 04:57:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 04:57:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-14 04:57:22,129 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 04:57:22,129 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 04:57:22,129 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:57:22,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-14 04:57:22,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:22,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:22,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:22,131 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:22,131 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:22,131 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 371#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#L558 assume !(main_~length1~0 < 1); 359#L558-2 assume !(main_~length2~0 < 1); 364#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(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.allocOnStack(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; 376#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 377#L545-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; 379#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 380#L548-1 assume !cstrcspn_#t~short7; 366#L548-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 367#L548-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 372#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 373#L545-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; 374#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 368#L545-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; 365#L548-5 [2019-01-14 04:57:22,131 INFO L796 eck$LassoCheckResult]: Loop: 365#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 360#L548-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#L548-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;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; 365#L548-5 [2019-01-14 04:57:22,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:22,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-01-14 04:57:22,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:22,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:22,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:22,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:22,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:22,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:22,154 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-01-14 04:57:22,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:22,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:22,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:22,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:22,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:22,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:22,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2019-01-14 04:57:22,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:22,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:22,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:22,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:22,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:22,483 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 04:57:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:22,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:57:22,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:57:22,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:22,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:22,645 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 [2019-01-14 04:57:22,652 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 [2019-01-14 04:57:22,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 04:57:22,697 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 [2019-01-14 04:57:22,705 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 [2019-01-14 04:57:22,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 04:57:22,872 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 [2019-01-14 04:57:22,872 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 04:57:23,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:57:23,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:57:23,091 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. [2019-01-14 04:57:23,091 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2019-01-14 04:58:01,202 WARN L181 SmtUtils]: Spent 1.84 s on a formula simplification that was a NOOP. DAG size: 20 [2019-01-14 04:58:27,742 WARN L181 SmtUtils]: Spent 2.49 s on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 04:58:42,473 WARN L181 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 04:58:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:58:42,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:58:42,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-14 04:58:42,727 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 04:58:42,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 04:58:42,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=116, Unknown=7, NotChecked=0, Total=156 [2019-01-14 04:58:42,730 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2019-01-14 04:58:42,954 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-01-14 04:58:47,240 WARN L181 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-01-14 04:58:50,048 WARN L181 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2019-01-14 04:58:50,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:58:50,147 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-01-14 04:58:50,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 04:58:50,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2019-01-14 04:58:50,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:58:50,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2019-01-14 04:58:50,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 04:58:50,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 04:58:50,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-01-14 04:58:50,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:58:50,155 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-01-14 04:58:50,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-01-14 04:58:50,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2019-01-14 04:58:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 04:58:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-14 04:58:50,159 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-14 04:58:50,159 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-14 04:58:50,160 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:58:50,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-01-14 04:58:50,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:58:50,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:58:50,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:58:50,164 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:58:50,164 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:58:50,164 INFO L794 eck$LassoCheckResult]: Stem: 539#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 534#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#L558 assume !(main_~length1~0 < 1); 520#L558-2 assume !(main_~length2~0 < 1); 525#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(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.allocOnStack(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; 540#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 541#L545-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; 543#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 523#L548-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#L548-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 535#L548-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 536#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 537#L545-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; 538#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 529#L545-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; 526#L548-5 [2019-01-14 04:58:50,164 INFO L796 eck$LassoCheckResult]: Loop: 526#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 521#L548-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#L548-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;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; 526#L548-5 [2019-01-14 04:58:50,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:50,165 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-01-14 04:58:50,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:50,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:50,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:50,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:50,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:50,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:50,198 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-01-14 04:58:50,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:50,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:50,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:50,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:58:50,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:50,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:50,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-01-14 04:58:50,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:50,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:50,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:50,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:58:50,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:50,369 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-14 04:58:51,220 WARN L181 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 137 [2019-01-14 04:58:52,297 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2019-01-14 04:58:52,304 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:58:52,304 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:58:52,304 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:58:52,305 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:58:52,305 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:58:52,305 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:58:52,305 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:58:52,305 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:58:52,305 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2019-01-14 04:58:52,305 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:58:52,305 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:58:52,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:52,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:52,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58: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 [2019-01-14 04:58: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 [2019-01-14 04:58:52,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:52,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:52,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:52,597 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 04:58:53,544 WARN L181 SmtUtils]: Spent 943.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-01-14 04:58:53,849 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-14 04:58:53,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:53,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:54,260 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-01-14 04:58:54,957 WARN L181 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 04:58:55,764 WARN L181 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-01-14 04:58:55,967 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 04:58:55,984 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:58:55,984 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:58:55,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:55,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:55,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:55,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:55,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:55,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:55,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:55,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:55,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:55,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:55,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:55,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:55,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:55,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:55,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:55,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:55,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:55,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:55,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:55,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:55,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:55,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:55,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:55,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:55,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:56,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:56,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:56,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:56,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:56,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:56,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:56,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:56,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:56,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:56,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:56,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:56,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:56,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:56,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:56,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:56,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:56,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:56,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:56,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:56,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:56,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:56,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:56,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:56,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:56,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:56,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:56,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:56,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:56,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:56,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:56,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:56,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:56,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:56,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:56,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:56,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:56,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:56,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:56,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:56,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:56,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:56,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:56,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:56,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:56,052 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:58:56,067 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 04:58:56,067 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 04:58:56,067 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:58:56,069 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:58:56,069 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:58:56,070 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3) = -1*ULTIMATE.start_cstrcspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 Supporting invariants [] [2019-01-14 04:58:56,724 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2019-01-14 04:58:56,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:58:56,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:56,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:56,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:58:56,974 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 [2019-01-14 04:58:56,974 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 04:58:57,030 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2019-01-14 04:58:57,031 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 [2019-01-14 04:58:57,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:58:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 04:58:57,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 04:58:57,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:57,032 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:58:57,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:57,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:57,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:58:57,130 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 04:58:57,130 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 04:58:57,182 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2019-01-14 04:58:57,184 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 [2019-01-14 04:58:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:58:57,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 04:58:57,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 04:58:57,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:57,185 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:58:57,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:57,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:57,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:58:57,273 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 04:58:57,273 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 04:58:57,323 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 45 states and 60 transitions. Complement of second has 5 states. [2019-01-14 04:58:57,325 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 [2019-01-14 04:58:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:58:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-14 04:58:57,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 04:58:57,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:57,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-14 04:58:57,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:57,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-14 04:58:57,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:57,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2019-01-14 04:58:57,332 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:58:57,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2019-01-14 04:58:57,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:58:57,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:58:57,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:58:57,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:58:57,333 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:58:57,333 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:58:57,333 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:58:57,333 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:58:57,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:58:57,333 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:58:57,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:58:57,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:58:57 BoogieIcfgContainer [2019-01-14 04:58:57,340 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:58:57,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:58:57,341 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:58:57,341 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:58:57,341 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:12" (3/4) ... [2019-01-14 04:58:57,347 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:58:57,347 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:58:57,348 INFO L168 Benchmark]: Toolchain (without parser) took 105911.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 354.9 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -71.9 MB). Peak memory consumption was 283.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:58:57,350 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:58:57,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:58:57,353 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:58:57,353 INFO L168 Benchmark]: Boogie Preprocessor took 54.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:58:57,354 INFO L168 Benchmark]: RCFGBuilder took 520.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:58:57,354 INFO L168 Benchmark]: BuchiAutomizer took 104629.57 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 226.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.6 MB). Peak memory consumption was 285.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:58:57,357 INFO L168 Benchmark]: Witness Printer took 6.88 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:58:57,363 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 641.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 520.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 104629.57 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 226.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.6 MB). Peak memory consumption was 285.1 MB. Max. memory is 11.5 GB. * Witness Printer took 6.88 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 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 -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 104.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 95.8s. Construction of modules took 0.3s. Büchi inclusion checks took 8.2s. 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: 102 SDtfs, 151 SDslu, 110 SDs, 0 SdLazy, 154 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital374 mio100 ax100 hnf99 lsp91 ukn72 mio100 lsp30 div135 bol100 ite100 ukn100 eq159 hnf81 smp91 dnf1042 smp33 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 166ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...