./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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/cstrspn-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 1f6e8c8b965f85c3429105401e9fda59f9f060cb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:11:04,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:11:04,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:11:04,501 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:11:04,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:11:04,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:11:04,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:11:04,507 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:11:04,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:11:04,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:11:04,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:11:04,511 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:11:04,512 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:11:04,513 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:11:04,514 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:11:04,515 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:11:04,516 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:11:04,518 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:11:04,521 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:11:04,522 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:11:04,524 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:11:04,525 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:11:04,528 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:11:04,529 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:11:04,529 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:11:04,530 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:11:04,531 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:11:04,532 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:11:04,535 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:11:04,539 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:11:04,539 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:11:04,540 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:11:04,540 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:11:04,540 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:11:04,542 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:11:04,544 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:11:04,546 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:11:04,571 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:11:04,571 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:11:04,572 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:11:04,572 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:11:04,577 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:11:04,578 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:11:04,578 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:11:04,578 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:11:04,578 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:11:04,578 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:11:04,579 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:11:04,579 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:11:04,579 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:11:04,579 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:11:04,579 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:11:04,580 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:11:04,580 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:11:04,580 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:11:04,580 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:11:04,580 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:11:04,580 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:11:04,581 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:11:04,582 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:11:04,582 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:11:04,582 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:11:04,583 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:11:04,583 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:11:04,583 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:11:04,583 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:11:04,583 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:11:04,583 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:11:04,585 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:11:04,585 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 -> 1f6e8c8b965f85c3429105401e9fda59f9f060cb [2018-11-29 00:11:04,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:11:04,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:11:04,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:11:04,670 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:11:04,671 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:11:04,672 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:04,741 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0915b226a/fb5ef615833e4bea80688372cd94664d/FLAG98795a508 [2018-11-29 00:11:05,225 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:11:05,225 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:05,240 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0915b226a/fb5ef615833e4bea80688372cd94664d/FLAG98795a508 [2018-11-29 00:11:05,512 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0915b226a/fb5ef615833e4bea80688372cd94664d [2018-11-29 00:11:05,516 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:11:05,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:11:05,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:05,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:11:05,525 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:11:05,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:05" (1/1) ... [2018-11-29 00:11:05,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59fb6464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:05, skipping insertion in model container [2018-11-29 00:11:05,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:05" (1/1) ... [2018-11-29 00:11:05,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:11:05,584 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:11:05,985 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:05,997 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:11:06,041 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:06,102 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:11:06,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06 WrapperNode [2018-11-29 00:11:06,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:06,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:06,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:11:06,104 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:11:06,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:06,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:11:06,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:11:06,282 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:11:06,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:11:06,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:11:06,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:11:06,340 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:11:06,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (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 [2018-11-29 00:11:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:11:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:11:06,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:11:06,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:11:06,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:11:06,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:11:06,869 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:11:06,869 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-29 00:11:06,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:06 BoogieIcfgContainer [2018-11-29 00:11:06,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:11:06,871 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:11:06,871 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:11:06,875 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:11:06,876 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:06,876 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:11:05" (1/3) ... [2018-11-29 00:11:06,877 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cfca659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:06, skipping insertion in model container [2018-11-29 00:11:06,877 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:06,877 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (2/3) ... [2018-11-29 00:11:06,878 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cfca659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:06, skipping insertion in model container [2018-11-29 00:11:06,878 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:06,878 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:06" (3/3) ... [2018-11-29 00:11:06,880 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:06,940 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:11:06,941 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:11:06,941 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:11:06,941 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:11:06,941 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:11:06,941 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:11:06,942 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:11:06,942 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:11:06,942 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:11:06,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-29 00:11:06,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-29 00:11:06,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:06,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:06,990 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:06,990 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:06,990 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:11:06,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-29 00:11:06,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-29 00:11:06,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:06,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:06,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:06,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:07,002 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.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 15#L545-4true [2018-11-29 00:11:07,002 INFO L796 eck$LassoCheckResult]: Loop: 15#L545-4true call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 8#L545-1true assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 9#L548-5true assume !true; 12#L548-6true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 18#L550true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 13#L545-3true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 15#L545-4true [2018-11-29 00:11:07,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:07,011 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-29 00:11:07,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:07,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:07,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:07,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:07,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:07,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-29 00:11:07,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:07,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:07,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:07,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:07,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:07,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:11:07,232 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:11:07,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-29 00:11:07,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-29 00:11:07,254 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-29 00:11:07,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:07,265 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-29 00:11:07,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:11:07,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-29 00:11:07,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-29 00:11:07,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-29 00:11:07,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-29 00:11:07,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-29 00:11:07,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-29 00:11:07,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:07,277 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-29 00:11:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-29 00:11:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-29 00:11:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-29 00:11:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-29 00:11:07,311 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-29 00:11:07,311 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-29 00:11:07,311 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:11:07,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-29 00:11:07,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-29 00:11:07,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:07,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:07,313 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:07,313 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:07,314 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.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 55#L545-4 [2018-11-29 00:11:07,314 INFO L796 eck$LassoCheckResult]: Loop: 55#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 51#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 50#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 46#L548-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 47#L548-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 49#L548-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 53#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 54#L545-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 55#L545-4 [2018-11-29 00:11:07,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:07,314 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-29 00:11:07,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:07,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:07,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:07,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:07,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:07,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-29 00:11:07,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:07,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:07,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:07,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:07,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:07,463 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-29 00:11:07,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:07,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:07,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:07,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:08,267 WARN L180 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-29 00:11:09,255 WARN L180 SmtUtils]: Spent 904.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-29 00:11:09,571 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-11-29 00:11:09,784 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-11-29 00:11:09,798 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:09,800 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:09,800 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:09,800 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:09,800 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:09,800 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:09,801 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:09,801 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:09,801 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-29 00:11:09,801 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:09,801 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:09,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:09,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,245 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-11-29 00:11:10,472 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-29 00:11:10,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:11,478 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2018-11-29 00:11:11,564 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:11,570 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:11,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:11,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:11,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:11,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:11,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:11,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:11,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:11,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:11,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:11,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:11,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:11,582 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:11,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:11,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:11,589 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:11,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:11,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:11,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:11,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:11,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:11,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:11,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:11,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:11,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:11,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:11,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:11,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:11,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:11,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:11,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:11,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:11,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:11,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:11,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:11,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:11,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:11,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:11,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:11,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:11,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:11,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:11,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:11,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:11,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:11,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:11,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:11,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:11,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:11,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:11,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:11,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:11,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:11,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:11,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:11,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:11,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:11,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:11,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:11,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:11,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:11,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:11,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:11,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:11,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:11,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:11,784 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:11,830 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:11:11,832 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-29 00:11:11,835 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:11,838 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:11,842 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:11,842 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0.offset Supporting invariants [] [2018-11-29 00:11:12,004 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-29 00:11:12,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:12,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:12,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:12,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:12,190 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:11:12,191 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-29 00:11:12,307 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-11-29 00:11:12,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:11:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:11:12,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-29 00:11:12,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-29 00:11:12,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:12,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-29 00:11:12,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:12,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-29 00:11:12,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:12,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-29 00:11:12,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:12,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-29 00:11:12,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-29 00:11:12,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-29 00:11:12,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-29 00:11:12,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:12,317 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-29 00:11:12,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-29 00:11:12,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-29 00:11:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-29 00:11:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-29 00:11:12,320 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-29 00:11:12,320 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-29 00:11:12,320 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:11:12,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-29 00:11:12,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:12,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:12,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:12,322 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:12,322 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:12,322 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.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 195#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 188#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 185#L548-5 [2018-11-29 00:11:12,322 INFO L796 eck$LassoCheckResult]: Loop: 185#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 180#L548-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 181#L548-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 185#L548-5 [2018-11-29 00:11:12,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:12,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-29 00:11:12,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:12,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:12,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:12,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:12,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:12,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:12,351 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-29 00:11:12,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:12,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:12,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:12,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:12,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:12,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:12,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-29 00:11:12,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:12,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:12,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:12,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:12,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:12,520 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-29 00:11:12,776 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-29 00:11:13,250 WARN L180 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-11-29 00:11:13,377 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-29 00:11:13,380 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:13,381 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:13,381 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:13,381 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:13,381 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:13,381 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:13,381 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:13,381 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:13,381 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-29 00:11:13,381 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:13,382 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:13,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,819 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2018-11-29 00:11:13,987 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-11-29 00:11:13,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,254 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-29 00:11:14,777 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-29 00:11:14,928 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:14,929 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:14,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:14,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:14,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:14,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:14,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:14,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:14,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:14,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:14,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:14,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:14,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:14,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:14,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,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 [2018-11-29 00:11:14,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:14,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:14,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:14,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:14,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:14,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:14,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:14,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:14,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:14,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:14,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:15,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:15,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:15,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:15,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:15,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:15,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:15,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:15,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:15,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:15,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:15,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:15,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:15,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:15,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:15,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,011 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:15,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:15,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,014 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:15,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:15,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:15,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,037 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:15,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:15,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,040 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:15,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:15,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:15,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:15,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:15,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:15,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:15,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:15,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:15,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:15,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:15,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:15,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:15,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:15,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:15,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:15,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:15,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:15,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:15,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:15,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:15,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:15,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:15,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,115 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:15,115 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-29 00:11:15,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,143 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-29 00:11:15,143 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-29 00:11:15,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:15,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:15,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:15,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:15,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:15,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:15,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:15,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:15,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:15,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:15,306 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:15,333 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:11:15,335 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-29 00:11:15,335 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:15,337 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:15,337 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:15,337 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-29 00:11:15,464 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-29 00:11:15,466 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:15,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:15,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:15,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:15,593 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-29 00:11:15,593 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-29 00:11:15,697 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-11-29 00:11:15,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:11:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-29 00:11:15,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-29 00:11:15,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:15,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-29 00:11:15,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:15,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-29 00:11:15,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:15,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-29 00:11:15,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:15,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-29 00:11:15,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-29 00:11:15,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-29 00:11:15,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-29 00:11:15,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:15,705 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-29 00:11:15,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-29 00:11:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-29 00:11:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-29 00:11:15,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-29 00:11:15,709 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-29 00:11:15,709 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-29 00:11:15,709 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:11:15,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-29 00:11:15,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:15,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:15,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:15,711 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:15,711 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:15,712 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.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 376#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 377#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 379#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 380#L548-1 assume !cstrspn_#t~short7; 366#L548-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 367#L548-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 372#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 373#L545-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 374#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 368#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 365#L548-5 [2018-11-29 00:11:15,712 INFO L796 eck$LassoCheckResult]: Loop: 365#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 360#L548-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 361#L548-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 365#L548-5 [2018-11-29 00:11:15,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:15,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-29 00:11:15,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:15,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:15,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:15,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:15,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:16,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:16,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-29 00:11:16,246 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:11:16,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:16,246 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-29 00:11:16,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:16,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:16,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:16,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:16,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:16,701 WARN L180 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-29 00:11:17,101 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-29 00:11:17,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:11:17,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:11:17,103 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-29 00:11:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:17,194 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-11-29 00:11:17,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-29 00:11:17,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-11-29 00:11:17,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:11:17,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-11-29 00:11:17,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-29 00:11:17,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-29 00:11:17,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-29 00:11:17,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:17,199 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-29 00:11:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-29 00:11:17,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-29 00:11:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-29 00:11:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-29 00:11:17,202 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-29 00:11:17,202 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-29 00:11:17,202 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:11:17,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-29 00:11:17,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:17,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:17,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:17,204 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:17,204 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:17,204 INFO L794 eck$LassoCheckResult]: Stem: 449#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 444#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; 430#L558 assume !(main_~length1~0 < 1); 431#L558-2 assume !(main_~length2~0 < 1); 436#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 450#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 451#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 442#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 443#L548-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 452#L548-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 445#L548-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 446#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 447#L545-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 448#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 440#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 437#L548-5 [2018-11-29 00:11:17,205 INFO L796 eck$LassoCheckResult]: Loop: 437#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 432#L548-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 433#L548-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 437#L548-5 [2018-11-29 00:11:17,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:17,205 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-29 00:11:17,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:17,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:17,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:17,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:17,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:17,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:17,233 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-29 00:11:17,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:17,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:17,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:17,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:17,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:17,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:17,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-29 00:11:17,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:17,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:17,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:17,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:17,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:17,414 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-29 00:11:17,539 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-29 00:11:18,210 WARN L180 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 135 [2018-11-29 00:11:19,162 WARN L180 SmtUtils]: Spent 906.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2018-11-29 00:11:19,165 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:19,165 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:19,165 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:19,165 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:19,165 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:19,165 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:19,166 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:19,166 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:19,166 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-29 00:11:19,166 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:19,166 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:19,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:19,424 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-29 00:11:20,329 WARN L180 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2018-11-29 00:11:20,508 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2018-11-29 00:11:20,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:20,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:20,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:20,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:20,712 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-11-29 00:11:21,502 WARN L180 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-11-29 00:11:21,853 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-29 00:11:22,078 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:22,079 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:22,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:22,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:22,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:22,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:22,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:22,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:22,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:22,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:22,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:22,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:22,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:22,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:22,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:22,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:22,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:22,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:22,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:22,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:22,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:22,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:22,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:22,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:22,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:22,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:22,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:22,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:22,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:22,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:22,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:22,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:22,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:22,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:22,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:22,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:22,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:22,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:22,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:22,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:22,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:22,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:22,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:22,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:22,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:22,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:22,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:22,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:22,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:22,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:22,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:22,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:22,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:22,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:22,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:22,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:22,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:22,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:22,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:22,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:22,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:22,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:22,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:22,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:22,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:22,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:22,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:22,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:22,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:22,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:22,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:22,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:22,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:22,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:22,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:22,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:22,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:22,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:22,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:22,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:22,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:22,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:22,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:22,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:22,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:22,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:22,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:22,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:22,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:22,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:22,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:22,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:22,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:22,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:22,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:22,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:22,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:22,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:22,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:22,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:22,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:22,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:22,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:22,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:22,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:22,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:22,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:22,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:22,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:22,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:22,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:22,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:22,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:22,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:22,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:22,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:22,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:22,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:22,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:22,150 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:22,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:22,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:22,151 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:22,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:22,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:22,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:22,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:22,169 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-29 00:11:22,169 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-29 00:11:22,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:22,203 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-11-29 00:11:22,203 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-29 00:11:22,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:22,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:22,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:22,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:22,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:22,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:22,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:22,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:22,384 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:22,410 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:11:22,416 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:11:22,416 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:22,417 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:22,417 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:22,417 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-29 00:11:22,718 INFO L297 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2018-11-29 00:11:22,721 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:22,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:22,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:22,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:22,865 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-29 00:11:22,866 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-29 00:11:22,981 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-29 00:11:22,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:11:22,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-29 00:11:22,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-29 00:11:22,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:22,985 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:11:23,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:23,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:23,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:23,121 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-29 00:11:23,121 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-29 00:11:23,170 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-29 00:11:23,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:11:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-29 00:11:23,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-29 00:11:23,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:23,176 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:11:23,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:23,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:23,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:23,403 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-29 00:11:23,404 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-29 00:11:23,488 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2018-11-29 00:11:23,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:11:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-29 00:11:23,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-29 00:11:23,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:23,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-29 00:11:23,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:23,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-29 00:11:23,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:23,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-11-29 00:11:23,496 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:23,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-29 00:11:23,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:11:23,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:11:23,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:11:23,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:23,499 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:23,499 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:23,499 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:23,499 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:11:23,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:11:23,499 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:23,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:11:23,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:11:23 BoogieIcfgContainer [2018-11-29 00:11:23,508 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:11:23,509 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:11:23,509 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:11:23,509 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:11:23,511 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:06" (3/4) ... [2018-11-29 00:11:23,515 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:11:23,515 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:11:23,516 INFO L168 Benchmark]: Toolchain (without parser) took 17999.40 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 383.8 MB). Free memory was 951.3 MB in the beginning and 1.3 GB in the end (delta: -370.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:23,517 INFO L168 Benchmark]: CDTParser took 0.36 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. [2018-11-29 00:11:23,518 INFO L168 Benchmark]: CACSL2BoogieTranslator took 584.06 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:23,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 177.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -216.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:23,520 INFO L168 Benchmark]: Boogie Preprocessor took 57.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:23,520 INFO L168 Benchmark]: RCFGBuilder took 530.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:23,521 INFO L168 Benchmark]: BuchiAutomizer took 16637.17 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 230.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.5 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:23,524 INFO L168 Benchmark]: Witness Printer took 5.95 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:23,530 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.36 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 584.06 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 177.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -216.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.50 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 530.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16637.17 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 230.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.5 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.95 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 15.0s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 118 SDslu, 72 SDs, 0 SdLazy, 103 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital367 mio100 ax100 hnf99 lsp92 ukn71 mio100 lsp31 div135 bol100 ite100 ukn100 eq165 hnf76 smp92 dnf691 smp24 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 168ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...