./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrspn_malloc_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-15/cstrspn_malloc_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 9c357a0f089ccce134e4135f49c3923f49db9d7a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:23:45,159 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:23:45,161 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:23:45,179 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:23:45,181 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:23:45,183 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:23:45,184 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:23:45,188 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:23:45,191 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:23:45,194 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:23:45,196 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:23:45,197 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:23:45,198 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:23:45,201 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:23:45,203 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:23:45,204 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:23:45,204 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:23:45,207 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:23:45,209 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:23:45,211 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:23:45,212 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:23:45,214 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:23:45,217 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:23:45,217 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:23:45,217 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:23:45,218 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:23:45,220 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:23:45,221 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:23:45,222 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:23:45,223 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:23:45,223 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:23:45,224 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:23:45,224 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:23:45,224 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:23:45,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:23:45,227 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:23:45,227 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:23:45,244 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:23:45,245 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:23:45,246 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:23:45,246 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:23:45,246 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:23:45,246 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:23:45,247 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:23:45,247 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:23:45,247 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:23:45,248 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:23:45,248 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:23:45,248 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:23:45,248 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:23:45,248 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:23:45,249 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:23:45,249 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:23:45,249 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:23:45,249 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:23:45,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:23:45,249 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:23:45,251 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:23:45,252 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:23:45,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:23:45,252 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:23:45,252 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:23:45,252 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:23:45,253 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:23:45,254 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:23:45,255 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:23:45,255 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c357a0f089ccce134e4135f49c3923f49db9d7a [2018-11-28 23:23:45,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:23:45,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:23:45,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:23:45,325 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:23:45,326 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:23:45,327 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrspn_malloc_true-termination.c.i [2018-11-28 23:23:45,392 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8fca87de/079f8e6a97f1444e8e2dfec4a7114a2a/FLAGbf71b880d [2018-11-28 23:23:45,965 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:23:45,966 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrspn_malloc_true-termination.c.i [2018-11-28 23:23:45,977 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8fca87de/079f8e6a97f1444e8e2dfec4a7114a2a/FLAGbf71b880d [2018-11-28 23:23:46,238 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8fca87de/079f8e6a97f1444e8e2dfec4a7114a2a [2018-11-28 23:23:46,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:23:46,244 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:23:46,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:23:46,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:23:46,250 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:23:46,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:46" (1/1) ... [2018-11-28 23:23:46,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@256fbe3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:46, skipping insertion in model container [2018-11-28 23:23:46,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:46" (1/1) ... [2018-11-28 23:23:46,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:23:46,301 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:23:46,704 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:23:46,725 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:23:46,815 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:23:46,968 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:23:46,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:46 WrapperNode [2018-11-28 23:23:46,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:23:46,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:23:46,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:23:46,970 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:23:46,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:46" (1/1) ... [2018-11-28 23:23:47,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:46" (1/1) ... [2018-11-28 23:23:47,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:23:47,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:23:47,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:23:47,033 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:23:47,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:46" (1/1) ... [2018-11-28 23:23:47,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:46" (1/1) ... [2018-11-28 23:23:47,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:46" (1/1) ... [2018-11-28 23:23:47,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:46" (1/1) ... [2018-11-28 23:23:47,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:46" (1/1) ... [2018-11-28 23:23:47,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:46" (1/1) ... [2018-11-28 23:23:47,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:46" (1/1) ... [2018-11-28 23:23:47,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:23:47,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:23:47,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:23:47,067 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:23:47,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:46" (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-28 23:23:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:23:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:23:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:23:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:23:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:23:47,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:23:47,563 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:23:47,563 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:23:47,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:47 BoogieIcfgContainer [2018-11-28 23:23:47,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:23:47,565 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:23:47,565 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:23:47,569 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:23:47,569 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:47,570 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:23:46" (1/3) ... [2018-11-28 23:23:47,571 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b42849e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:47, skipping insertion in model container [2018-11-28 23:23:47,571 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:47,571 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:46" (2/3) ... [2018-11-28 23:23:47,571 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b42849e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:47, skipping insertion in model container [2018-11-28 23:23:47,572 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:47,572 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:47" (3/3) ... [2018-11-28 23:23:47,573 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn_malloc_true-termination.c.i [2018-11-28 23:23:47,627 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:23:47,627 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:23:47,628 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:23:47,628 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:23:47,628 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:23:47,628 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:23:47,628 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:23:47,628 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:23:47,629 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:23:47,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:23:47,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:23:47,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:47,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:47,672 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:23:47,672 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:23:47,672 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:23:47,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:23:47,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:23:47,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:47,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:47,675 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:23:47,676 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:23:47,685 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, 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; 6#L369-4true [2018-11-28 23:23:47,685 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 8#L374true assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 5#L369-3true cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 6#L369-4true [2018-11-28 23:23:47,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:47,693 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-28 23:23:47,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:47,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:47,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:47,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:47,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:47,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:47,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-28 23:23:47,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:47,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:47,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:47,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:47,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:47,899 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-28 23:23:47,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:23:47,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:23:47,906 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:23:47,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:23:47,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:23:47,927 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-28 23:23:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:23:47,936 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-28 23:23:47,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:23:47,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-28 23:23:47,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:23:47,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-28 23:23:47,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:23:47,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:23:47,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-28 23:23:47,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:23:47,948 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 23:23:47,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-28 23:23:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-28 23:23:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:23:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-28 23:23:47,980 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 23:23:47,981 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 23:23:47,981 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:23:47,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-28 23:23:47,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:23:47,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:47,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:47,983 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:23:47,983 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:47,983 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, 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; 47#L369-4 [2018-11-28 23:23:47,983 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 56#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 53#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208; 44#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 45#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 46#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 47#L369-4 [2018-11-28 23:23:47,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:47,984 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-28 23:23:47,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:47,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:47,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:47,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:47,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:48,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:48,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-28 23:23:48,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:48,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:48,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:48,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:23:48,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:48,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:48,131 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-28 23:23:48,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:48,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:48,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:48,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:48,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:48,851 WARN L180 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-28 23:23:49,930 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-28 23:23:50,258 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-11-28 23:23:50,436 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-11-28 23:23:50,453 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:23:50,454 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:23:50,454 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:23:50,455 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:23:50,455 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:23:50,455 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:23:50,455 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:23:50,455 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:23:50,456 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:23:50,456 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:23:50,456 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:23:50,483 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-28 23:23:50,506 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-28 23:23:50,508 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-28 23:23:50,511 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-28 23:23:50,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-28 23:23:50,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-28 23:23:50,906 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2018-11-28 23:23:51,180 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-28 23:23:51,181 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-28 23:23:51,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-28 23:23:51,195 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-28 23:23:51,197 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-28 23:23:51,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-28 23:23:51,211 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-28 23:23:51,213 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-28 23:23:51,216 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-28 23:23:51,219 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-28 23:23:51,224 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-28 23:23:51,226 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-28 23:23:51,229 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-28 23:23:51,233 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-28 23:23:52,191 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2018-11-28 23:23:52,220 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:23:52,226 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:23:52,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:52,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:52,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:52,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:52,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:52,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:52,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:52,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:52,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:52,237 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-28 23:23:52,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:52,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:52,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:52,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:52,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:52,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:52,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:52,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:52,240 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-28 23:23:52,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:52,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:52,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:52,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:52,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:52,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:52,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:52,248 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-28 23:23:52,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:52,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:52,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:52,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:52,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:52,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:52,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:52,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:52,250 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-28 23:23:52,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:52,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:52,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:52,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:52,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:52,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:52,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:52,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:52,253 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-28 23:23:52,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:52,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:52,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:52,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:52,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:52,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:52,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:52,271 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-28 23:23:52,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:52,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:52,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:52,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:52,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:52,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:52,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:52,277 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-28 23:23:52,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:52,278 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:23:52,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:52,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:52,282 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:23:52,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:52,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:52,297 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-28 23:23:52,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:52,298 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:23:52,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:52,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:52,303 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:23:52,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:52,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:52,321 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-28 23:23:52,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:52,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:52,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:52,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:52,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:52,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:52,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:52,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:52,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:52,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:52,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:52,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:52,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:52,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:52,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:52,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:52,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:52,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:52,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:52,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:52,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:52,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:52,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:52,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:52,336 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-28 23:23:52,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:52,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:52,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:52,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:52,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:52,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:52,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:52,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:52,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:52,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:52,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:52,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:52,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:52,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:52,383 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:23:52,440 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 23:23:52,443 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:23:52,445 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:23:52,448 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:23:52,450 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:23:52,450 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 Supporting invariants [] [2018-11-28 23:23:52,533 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 23:23:52,545 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:23:52,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:52,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:52,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:52,781 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-28 23:23:52,785 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-28 23:23:52,786 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:23:52,872 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-28 23:23:52,873 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-28 23:23:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:23:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-28 23:23:52,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-28 23:23:52,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:52,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-28 23:23:52,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:52,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-28 23:23:52,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:52,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-28 23:23:52,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:23:52,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-28 23:23:52,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:23:52,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:23:52,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-28 23:23:52,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:23:52,881 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 23:23:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-28 23:23:52,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-28 23:23:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 23:23:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-28 23:23:52,884 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 23:23:52,884 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 23:23:52,884 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:23:52,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-28 23:23:52,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:23:52,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:52,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:52,885 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:52,885 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:23:52,886 INFO L794 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 187#L382 assume !(main_~length1~0 < 1); 188#L382-2 assume !(main_~length2~0 < 1); 185#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, 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; 182#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 184#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 194#L372-5 [2018-11-28 23:23:52,886 INFO L796 eck$LassoCheckResult]: Loop: 194#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 189#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 190#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 194#L372-5 [2018-11-28 23:23:52,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:52,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-28 23:23:52,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:52,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:52,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:52,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:52,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:52,913 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-28 23:23:52,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:52,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:52,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:52,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:52,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:52,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-28 23:23:52,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:52,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:52,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:52,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:53,120 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-28 23:23:53,260 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-28 23:23:53,571 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2018-11-28 23:23:53,697 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-28 23:23:53,700 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:23:53,700 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:23:53,700 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:23:53,701 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:23:53,701 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:23:53,701 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:23:53,701 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:23:53,701 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:23:53,701 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:23:53,701 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:23:53,701 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:23:53,707 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-28 23:23:53,747 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-28 23:23:53,771 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-28 23:23:53,776 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-28 23:23:53,778 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-28 23:23:53,782 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-28 23:23:53,784 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-28 23:23:53,786 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-28 23:23:53,788 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-28 23:23:53,790 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-28 23:23:54,202 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2018-11-28 23:23:54,381 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2018-11-28 23:23:54,381 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-28 23:23:54,383 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-28 23:23:54,385 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-28 23:23:54,388 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-28 23:23:54,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-28 23:23:54,394 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-28 23:23:54,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-28 23:23:54,397 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-28 23:23:54,399 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-28 23:23:55,121 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-28 23:23:55,503 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-28 23:23:55,665 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:23:55,666 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:23:55,666 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-28 23:23:55,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:55,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:55,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:55,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:55,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:55,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:55,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:55,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:55,672 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-28 23:23:55,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:55,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:55,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:55,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:55,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:55,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:55,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:55,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:55,677 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-28 23:23:55,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:55,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:55,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:55,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:55,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:55,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:55,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:55,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:55,682 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-28 23:23:55,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:55,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:55,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:55,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:55,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:55,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:55,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:55,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:55,689 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-28 23:23:55,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:55,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:55,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:55,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:55,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:55,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:55,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:55,696 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-28 23:23:55,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:55,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:55,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:55,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:55,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:55,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:55,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:55,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:55,701 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-28 23:23:55,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:55,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:55,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:55,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:55,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:55,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:55,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:55,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:55,707 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-28 23:23:55,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:55,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:55,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:55,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:55,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:55,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:55,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:55,714 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-28 23:23:55,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:55,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:55,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:55,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:55,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:55,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:55,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:55,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:55,719 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-28 23:23:55,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:55,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:55,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:55,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:55,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:55,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:55,754 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:23:55,778 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:23:55,778 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:23:55,779 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:23:55,780 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:23:55,781 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:23:55,782 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-28 23:23:56,215 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-11-28 23:23:56,252 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:23:56,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:56,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:56,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:56,693 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-28 23:23:56,694 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-28 23:23:56,694 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-28 23:23:56,763 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-28 23:23:56,764 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-28 23:23:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:23:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 23:23:56,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:23:56,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:56,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 23:23:56,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:56,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 23:23:56,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:56,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-28 23:23:56,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:23:56,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-28 23:23:56,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:23:56,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:23:56,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-28 23:23:56,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:23:56,770 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-28 23:23:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-28 23:23:56,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-28 23:23:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:23:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-28 23:23:56,775 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-28 23:23:56,775 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-28 23:23:56,776 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:23:56,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-28 23:23:56,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:23:56,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:56,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:56,778 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:56,778 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:23:56,778 INFO L794 eck$LassoCheckResult]: Stem: 382#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 375#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 376#L382 assume !(main_~length1~0 < 1); 377#L382-2 assume !(main_~length2~0 < 1); 374#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, 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; 370#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 371#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 384#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 380#L372-1 assume !cstrspn_#t~short210; 381#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208; 366#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 367#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 368#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 369#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 373#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 383#L372-5 [2018-11-28 23:23:56,778 INFO L796 eck$LassoCheckResult]: Loop: 383#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 378#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 379#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 383#L372-5 [2018-11-28 23:23:56,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:56,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-28 23:23:56,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:56,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:56,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:56,893 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-28 23:23:56,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:23:56,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:23:56,894 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:23:56,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:56,894 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-28 23:23:56,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:56,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:56,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:56,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:56,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:57,015 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-28 23:23:57,124 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-28 23:23:57,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:23:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:23:57,126 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 23:23:57,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:23:57,219 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-11-28 23:23:57,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:23:57,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-11-28 23:23:57,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:23:57,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-11-28 23:23:57,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:23:57,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:23:57,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-28 23:23:57,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:23:57,225 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-28 23:23:57,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-28 23:23:57,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-28 23:23:57,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 23:23:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-28 23:23:57,229 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-28 23:23:57,229 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-28 23:23:57,229 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:23:57,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-28 23:23:57,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:23:57,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:57,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:57,232 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:57,233 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:23:57,233 INFO L794 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 447#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 448#L382 assume !(main_~length1~0 < 1); 449#L382-2 assume !(main_~length2~0 < 1); 446#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, 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; 442#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 443#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 456#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 460#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 459#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208; 438#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 439#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 440#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 441#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 445#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 455#L372-5 [2018-11-28 23:23:57,234 INFO L796 eck$LassoCheckResult]: Loop: 455#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 451#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 452#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 455#L372-5 [2018-11-28 23:23:57,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:57,234 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-28 23:23:57,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:57,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:57,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:57,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:23:57,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:57,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:57,263 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-28 23:23:57,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:57,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:57,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:57,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:23:57,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:57,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:57,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-28 23:23:57,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:57,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:57,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:57,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:23:57,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:57,480 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-28 23:23:57,783 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-28 23:23:58,566 WARN L180 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 137 [2018-11-28 23:23:59,537 WARN L180 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2018-11-28 23:23:59,539 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:23:59,539 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:23:59,539 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:23:59,540 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:23:59,540 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:23:59,540 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:23:59,540 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:23:59,540 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:23:59,540 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration5_Lasso [2018-11-28 23:23:59,541 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:23:59,541 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:23:59,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-28 23:23:59,564 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-28 23:23:59,565 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-28 23:23:59,567 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-28 23:23:59,569 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-28 23:23:59,571 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-28 23:23:59,573 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-28 23:23:59,576 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-28 23:23:59,814 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 23:24:00,809 WARN L180 SmtUtils]: Spent 992.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2018-11-28 23:24:01,006 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-11-28 23:24:01,007 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-28 23:24:01,014 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-28 23:24:01,016 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-28 23:24:01,019 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-28 23:24:01,021 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-28 23:24:01,024 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-28 23:24:01,028 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-28 23:24:01,029 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-28 23:24:01,030 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-28 23:24:01,033 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-28 23:24:01,035 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-28 23:24:01,183 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-11-28 23:24:01,913 WARN L180 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-11-28 23:24:02,165 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-28 23:24:02,474 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:02,475 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:02,475 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-28 23:24:02,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:02,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:02,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:02,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:02,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:02,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:02,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:02,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:02,482 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-28 23:24:02,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:02,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:02,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:02,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:02,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:02,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:02,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:02,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:02,483 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-28 23:24:02,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:02,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:02,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:02,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:02,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:02,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:02,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:02,495 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-28 23:24:02,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:02,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:02,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:02,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:02,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:02,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:02,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:02,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:02,500 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-28 23:24:02,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:02,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:02,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:02,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:02,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:02,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:02,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:02,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:02,506 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-28 23:24:02,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:02,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:02,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:02,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:02,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:02,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:02,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:02,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:02,511 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-28 23:24:02,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:02,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:02,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:02,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:02,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:02,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:02,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:02,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:02,513 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-28 23:24:02,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:02,513 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-28 23:24:02,513 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-28 23:24:02,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:02,552 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-11-28 23:24:02,553 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-28 23:24:02,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:02,688 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-28 23:24:02,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:02,689 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:02,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:02,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:02,690 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:02,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:02,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:02,703 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-28 23:24:02,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:02,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:02,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:02,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:02,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:02,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:02,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:02,713 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-28 23:24:02,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:02,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:02,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:02,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:02,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:02,714 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:02,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:02,719 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-28 23:24:02,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:02,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:02,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:02,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:02,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:02,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:02,747 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:02,768 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:24:02,768 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:24:02,770 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:02,770 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:02,771 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:02,771 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-28 23:24:03,090 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2018-11-28 23:24:03,093 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:24:03,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:03,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:03,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:03,210 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-28 23:24:03,211 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-28 23:24:03,211 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-28 23:24:03,321 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-28 23:24:03,323 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-28 23:24:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:24:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 23:24:03,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 23:24:03,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:03,324 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:24:03,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:03,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:03,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:03,498 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-28 23:24:03,499 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-28 23:24:03,499 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-28 23:24:03,561 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-28 23:24:03,565 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-28 23:24:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:24:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 23:24:03,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 23:24:03,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:03,566 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:24:03,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:03,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:03,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:03,717 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-28 23:24:03,717 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-28 23:24:03,718 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-28 23:24:03,760 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-28 23:24:03,761 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-28 23:24:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:24:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-28 23:24:03,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 23:24:03,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:03,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-28 23:24:03,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:03,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-28 23:24:03,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:03,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-11-28 23:24:03,768 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:03,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-28 23:24:03,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:24:03,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:24:03,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:24:03,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:03,768 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:03,769 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:03,769 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:03,769 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:24:03,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:24:03,769 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:03,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:24:03,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:24:03 BoogieIcfgContainer [2018-11-28 23:24:03,776 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:24:03,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:24:03,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:24:03,777 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:24:03,779 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:47" (3/4) ... [2018-11-28 23:24:03,782 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:24:03,782 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:24:03,783 INFO L168 Benchmark]: Toolchain (without parser) took 17539.98 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 382.2 MB). Free memory was 954.0 MB in the beginning and 1.3 GB in the end (delta: -386.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:03,784 INFO L168 Benchmark]: CDTParser took 0.17 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-28 23:24:03,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:03,785 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.80 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:03,786 INFO L168 Benchmark]: Boogie Preprocessor took 33.55 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-28 23:24:03,788 INFO L168 Benchmark]: RCFGBuilder took 497.49 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-28 23:24:03,789 INFO L168 Benchmark]: BuchiAutomizer took 16211.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 249.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -252.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:03,790 INFO L168 Benchmark]: Witness Printer took 5.29 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-28 23:24:03,796 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.17 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 724.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.80 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.55 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 497.49 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 16211.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 249.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -252.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.29 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 -1 * sc1 + unknown-#length-unknown[malloc(length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[malloc(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.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 14.3s. Construction of modules took 0.2s. Büchi inclusion checks took 1.4s. 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, 122 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: inital374 mio100 ax100 hnf99 lsp91 ukn72 mio100 lsp32 div133 bol100 ite100 ukn100 eq171 hnf76 smp96 dnf623 smp24 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 174ms 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...