./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cd26dd80-1a33-46f1-80fe-f6e579f13cb5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cd26dd80-1a33-46f1-80fe-f6e579f13cb5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cd26dd80-1a33-46f1-80fe-f6e579f13cb5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cd26dd80-1a33-46f1-80fe-f6e579f13cb5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cd26dd80-1a33-46f1-80fe-f6e579f13cb5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cd26dd80-1a33-46f1-80fe-f6e579f13cb5/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f39f60c3148e6a8957b92a35d12d506fd8229368 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 16:00:36,176 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 16:00:36,177 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 16:00:36,185 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 16:00:36,186 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 16:00:36,186 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 16:00:36,187 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 16:00:36,188 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 16:00:36,190 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 16:00:36,190 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 16:00:36,191 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 16:00:36,191 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 16:00:36,192 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 16:00:36,193 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 16:00:36,194 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 16:00:36,194 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 16:00:36,195 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 16:00:36,196 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 16:00:36,198 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 16:00:36,199 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 16:00:36,200 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 16:00:36,201 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 16:00:36,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 16:00:36,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 16:00:36,203 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 16:00:36,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 16:00:36,204 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 16:00:36,205 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 16:00:36,206 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 16:00:36,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 16:00:36,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 16:00:36,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 16:00:36,208 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 16:00:36,208 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 16:00:36,209 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 16:00:36,209 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 16:00:36,209 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cd26dd80-1a33-46f1-80fe-f6e579f13cb5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 16:00:36,221 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 16:00:36,221 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 16:00:36,222 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 16:00:36,222 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 16:00:36,222 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 16:00:36,223 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 16:00:36,223 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 16:00:36,223 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 16:00:36,223 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 16:00:36,223 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 16:00:36,223 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 16:00:36,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 16:00:36,224 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 16:00:36,224 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 16:00:36,224 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 16:00:36,224 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 16:00:36,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 16:00:36,224 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 16:00:36,224 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 16:00:36,225 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 16:00:36,225 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 16:00:36,225 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 16:00:36,225 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 16:00:36,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 16:00:36,225 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 16:00:36,225 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 16:00:36,225 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 16:00:36,226 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 16:00:36,226 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 16:00:36,227 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_cd26dd80-1a33-46f1-80fe-f6e579f13cb5/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f39f60c3148e6a8957b92a35d12d506fd8229368 [2018-11-23 16:00:36,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 16:00:36,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 16:00:36,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 16:00:36,263 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 16:00:36,264 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 16:00:36,264 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cd26dd80-1a33-46f1-80fe-f6e579f13cb5/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c [2018-11-23 16:00:36,305 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd26dd80-1a33-46f1-80fe-f6e579f13cb5/bin-2019/uautomizer/data/2ee9e26a8/ac30df4488e847a992945ae328de54c3/FLAG2e34dc336 [2018-11-23 16:00:36,643 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 16:00:36,644 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cd26dd80-1a33-46f1-80fe-f6e579f13cb5/sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c [2018-11-23 16:00:36,650 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd26dd80-1a33-46f1-80fe-f6e579f13cb5/bin-2019/uautomizer/data/2ee9e26a8/ac30df4488e847a992945ae328de54c3/FLAG2e34dc336 [2018-11-23 16:00:37,070 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cd26dd80-1a33-46f1-80fe-f6e579f13cb5/bin-2019/uautomizer/data/2ee9e26a8/ac30df4488e847a992945ae328de54c3 [2018-11-23 16:00:37,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 16:00:37,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 16:00:37,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 16:00:37,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 16:00:37,078 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 16:00:37,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:00:37" (1/1) ... [2018-11-23 16:00:37,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f57c443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:00:37, skipping insertion in model container [2018-11-23 16:00:37,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:00:37" (1/1) ... [2018-11-23 16:00:37,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 16:00:37,105 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 16:00:37,262 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 16:00:37,271 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 16:00:37,286 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 16:00:37,301 INFO L195 MainTranslator]: Completed translation [2018-11-23 16:00:37,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:00:37 WrapperNode [2018-11-23 16:00:37,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 16:00:37,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 16:00:37,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 16:00:37,302 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 16:00:37,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:00:37" (1/1) ... [2018-11-23 16:00:37,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:00:37" (1/1) ... [2018-11-23 16:00:37,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 16:00:37,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 16:00:37,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 16:00:37,333 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 16:00:37,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:00:37" (1/1) ... [2018-11-23 16:00:37,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:00:37" (1/1) ... [2018-11-23 16:00:37,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:00:37" (1/1) ... [2018-11-23 16:00:37,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:00:37" (1/1) ... [2018-11-23 16:00:37,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:00:37" (1/1) ... [2018-11-23 16:00:37,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:00:37" (1/1) ... [2018-11-23 16:00:37,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:00:37" (1/1) ... [2018-11-23 16:00:37,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 16:00:37,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 16:00:37,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 16:00:37,401 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 16:00:37,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:00:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd26dd80-1a33-46f1-80fe-f6e579f13cb5/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 16:00:37,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 16:00:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 16:00:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 16:00:37,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 16:00:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 16:00:37,641 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 16:00:37,642 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 16:00:37,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:00:37 BoogieIcfgContainer [2018-11-23 16:00:37,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 16:00:37,642 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 16:00:37,643 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 16:00:37,646 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 16:00:37,647 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 16:00:37,647 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 04:00:37" (1/3) ... [2018-11-23 16:00:37,648 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cd6fd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:00:37, skipping insertion in model container [2018-11-23 16:00:37,648 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 16:00:37,648 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:00:37" (2/3) ... [2018-11-23 16:00:37,648 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cd6fd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:00:37, skipping insertion in model container [2018-11-23 16:00:37,648 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 16:00:37,649 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:00:37" (3/3) ... [2018-11-23 16:00:37,650 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_true-termination_true-no-overflow.c [2018-11-23 16:00:37,689 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 16:00:37,689 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 16:00:37,689 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 16:00:37,690 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 16:00:37,690 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 16:00:37,690 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 16:00:37,690 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 16:00:37,690 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 16:00:37,690 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 16:00:37,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-23 16:00:37,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 16:00:37,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 16:00:37,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 16:00:37,724 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:00:37,725 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 16:00:37,725 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 16:00:37,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-23 16:00:37,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 16:00:37,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 16:00:37,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 16:00:37,727 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:00:37,727 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 16:00:37,733 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 22#L14true assume !(build_nondet_String_~length~0 < 1); 18#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 10#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 17#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 12#L14-5true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 8#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 3#L30-4true [2018-11-23 16:00:37,734 INFO L796 eck$LassoCheckResult]: Loop: 3#L30-4true call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 9#L30-1true assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 7#L33-5true assume !true; 4#L33-6true call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 20#L35true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 5#L30-3true cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 3#L30-4true [2018-11-23 16:00:37,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:00:37,738 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2018-11-23 16:00:37,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:00:37,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:00:37,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:37,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:00:37,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:37,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:00:37,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2018-11-23 16:00:37,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:00:37,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:00:37,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:37,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:00:37,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:00:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 16:00:37,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 16:00:37,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 16:00:37,884 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 16:00:37,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 16:00:37,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 16:00:37,896 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 16:00:37,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 16:00:37,901 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-11-23 16:00:37,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 16:00:37,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-11-23 16:00:37,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 16:00:37,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2018-11-23 16:00:37,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 16:00:37,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 16:00:37,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-11-23 16:00:37,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 16:00:37,911 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-23 16:00:37,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-11-23 16:00:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 16:00:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 16:00:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-23 16:00:37,933 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-23 16:00:37,933 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-23 16:00:37,933 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 16:00:37,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-23 16:00:37,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 16:00:37,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 16:00:37,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 16:00:37,935 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:00:37,935 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:00:37,935 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 63#L14 assume !(build_nondet_String_~length~0 < 1); 65#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 58#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 59#L14-3 assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 61#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 57#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 50#L30-4 [2018-11-23 16:00:37,935 INFO L796 eck$LassoCheckResult]: Loop: 50#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 51#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 55#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 56#L33-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 60#L33-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5; 52#L33-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 53#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 54#L30-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 50#L30-4 [2018-11-23 16:00:37,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:00:37,936 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2018-11-23 16:00:37,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:00:37,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:00:37,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:37,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:00:37,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:37,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:00:37,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2018-11-23 16:00:37,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:00:37,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:00:37,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:37,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 16:00:37,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:37,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:00:37,995 INFO L82 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2018-11-23 16:00:37,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:00:37,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:00:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:37,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:00:37,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:00:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 16:00:38,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 16:00:38,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 16:00:38,357 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-23 16:00:38,589 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-23 16:00:38,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 16:00:38,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 16:00:38,590 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-23 16:00:38,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 16:00:38,738 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 16:00:38,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 16:00:38,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-23 16:00:38,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 16:00:38,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 16:00:38,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-23 16:00:38,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-23 16:00:38,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2018-11-23 16:00:38,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 16:00:38,741 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 16:00:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2018-11-23 16:00:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-11-23 16:00:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 16:00:38,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 16:00:38,744 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 16:00:38,745 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 16:00:38,745 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 16:00:38,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-23 16:00:38,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 16:00:38,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 16:00:38,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 16:00:38,747 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:00:38,747 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:00:38,747 INFO L794 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 131#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 132#L14 assume !(build_nondet_String_~length~0 < 1); 137#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 127#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 128#L14-3 assume !(build_nondet_String_~length~0 < 1); 136#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 142#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 141#L30-4 [2018-11-23 16:00:38,747 INFO L796 eck$LassoCheckResult]: Loop: 141#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 140#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 123#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 124#L33-1 assume !cstrcspn_#t~short7; 129#L33-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5; 120#L33-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 121#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 138#L30-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 141#L30-4 [2018-11-23 16:00:38,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:00:38,748 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2018-11-23 16:00:38,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:00:38,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:00:38,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:38,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:00:38,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:38,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:00:38,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1951138125, now seen corresponding path program 1 times [2018-11-23 16:00:38,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:00:38,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:00:38,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:38,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:00:38,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:38,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:00:38,797 INFO L82 PathProgramCache]: Analyzing trace with hash -252975234, now seen corresponding path program 1 times [2018-11-23 16:00:38,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:00:38,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:00:38,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:38,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:00:38,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:39,222 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2018-11-23 16:00:39,319 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 16:00:39,320 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 16:00:39,320 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 16:00:39,320 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 16:00:39,320 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 16:00:39,321 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 16:00:39,321 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 16:00:39,321 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 16:00:39,321 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration3_Lasso [2018-11-23 16:00:39,321 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 16:00:39,321 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 16:00:39,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:39,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:39,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:39,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:39,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:39,556 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-11-23 16:00:39,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:39,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:39,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:39,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:39,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:39,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:39,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:39,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:39,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:39,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:39,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:39,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:40,028 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 16:00:40,032 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 16:00:40,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:40,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:40,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:40,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:40,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:40,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:40,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:40,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:40,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:40,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:40,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:40,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:40,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:40,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:40,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:40,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:40,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:40,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:40,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:40,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:40,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:40,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:40,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:40,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:40,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:40,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:40,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:40,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:40,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:40,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:40,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:40,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:40,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 16:00:40,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:00:40,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:40,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:40,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:40,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:40,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:40,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:40,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 16:00:40,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:00:40,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:40,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:40,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:40,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:40,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:40,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:40,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:40,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:40,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:40,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:40,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:40,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:40,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:40,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:40,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:40,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 16:00:40,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:00:40,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:40,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:40,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:40,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:40,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:40,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:40,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 16:00:40,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:00:40,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:40,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:40,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:40,101 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 16:00:40,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:40,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:40,103 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 16:00:40,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:00:40,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:40,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:40,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:40,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:40,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:40,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:40,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 16:00:40,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:00:40,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:40,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:40,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:40,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:40,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:40,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:40,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:40,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:40,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:40,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:40,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:40,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:40,127 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 16:00:40,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:40,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:40,129 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 16:00:40,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:00:40,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:40,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:40,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:40,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:40,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:40,141 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 16:00:40,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:40,142 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 16:00:40,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:40,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:40,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:40,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:40,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:40,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:40,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:40,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 16:00:40,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:00:40,168 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 16:00:40,179 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 16:00:40,179 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 16:00:40,181 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 16:00:40,182 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 16:00:40,182 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 16:00:40,183 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2018-11-23 16:00:40,224 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-23 16:00:40,231 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 16:00:40,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:00:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:00:40,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:00:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:00:40,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:00:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 16:00:40,312 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 16:00:40,313 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 16:00:40,367 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2018-11-23 16:00:40,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 16:00:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 16:00:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-23 16:00:40,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-23 16:00:40,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 16:00:40,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-23 16:00:40,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 16:00:40,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2018-11-23 16:00:40,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 16:00:40,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2018-11-23 16:00:40,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 16:00:40,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2018-11-23 16:00:40,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 16:00:40,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 16:00:40,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-23 16:00:40,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 16:00:40,375 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 16:00:40,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-23 16:00:40,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 16:00:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 16:00:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-23 16:00:40,377 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 16:00:40,377 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 16:00:40,377 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 16:00:40,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-23 16:00:40,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 16:00:40,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 16:00:40,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 16:00:40,379 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:00:40,379 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 16:00:40,379 INFO L794 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 307#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 308#L14 assume !(build_nondet_String_~length~0 < 1); 311#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 302#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 303#L14-3 assume !(build_nondet_String_~length~0 < 1); 306#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 301#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 290#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 292#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 297#L33-5 [2018-11-23 16:00:40,379 INFO L796 eck$LassoCheckResult]: Loop: 297#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 298#L33-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 304#L33-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 297#L33-5 [2018-11-23 16:00:40,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:00:40,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2018-11-23 16:00:40,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:00:40,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:00:40,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:40,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:00:40,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:40,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:00:40,407 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2018-11-23 16:00:40,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:00:40,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:00:40,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:40,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:00:40,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:40,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:00:40,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2018-11-23 16:00:40,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:00:40,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:00:40,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:40,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:00:40,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:41,055 WARN L180 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 117 [2018-11-23 16:00:41,158 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 16:00:41,158 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 16:00:41,158 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 16:00:41,158 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 16:00:41,158 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 16:00:41,158 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 16:00:41,159 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 16:00:41,159 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 16:00:41,159 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration4_Lasso [2018-11-23 16:00:41,159 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 16:00:41,159 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 16:00:41,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:41,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:41,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:41,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:41,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:41,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:41,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-23 16:00:41,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:41,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:41,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:41,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:41,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:41,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-23 16:00:41,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:41,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:41,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-23 16:00:41,379 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2018-11-23 16:00:41,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:00:41,796 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-23 16:00:41,815 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 16:00:41,816 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 16:00:41,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:41,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:41,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:41,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:41,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:41,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:41,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:41,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:41,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:41,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 16:00:41,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:00:41,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:41,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:41,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:41,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:41,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:41,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:41,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:41,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:41,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:41,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:41,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:41,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:41,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:41,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:41,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:41,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 16:00:41,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:00:41,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:41,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:41,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:41,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:41,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:41,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:41,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:41,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:41,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:41,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:41,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:41,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:41,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:00:41,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:00:41,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:00:41,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,848 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 16:00:41,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,851 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 16:00:41,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:00:41,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 16:00:41,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:00:41,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 16:00:41,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:00:41,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 16:00:41,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:00:41,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:00:41,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:00:41,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:00:41,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:00:41,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:00:41,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:00:41,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 16:00:41,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:00:41,891 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 16:00:41,903 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 16:00:41,903 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 16:00:41,903 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 16:00:41,905 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 16:00:41,905 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 16:00:41,906 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-23 16:00:41,954 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 16:00:41,956 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 16:00:41,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:00:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:00:41,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:00:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:00:42,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:00:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 16:00:42,022 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 16:00:42,022 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-23 16:00:42,125 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 49 states and 59 transitions. Complement of second has 7 states. [2018-11-23 16:00:42,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 16:00:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 16:00:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-23 16:00:42,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 16:00:42,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 16:00:42,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-23 16:00:42,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 16:00:42,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-23 16:00:42,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 16:00:42,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2018-11-23 16:00:42,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 16:00:42,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 42 transitions. [2018-11-23 16:00:42,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 16:00:42,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 16:00:42,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-11-23 16:00:42,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 16:00:42,132 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-23 16:00:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-11-23 16:00:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-11-23 16:00:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 16:00:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-23 16:00:42,134 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-23 16:00:42,134 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-23 16:00:42,135 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 16:00:42,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-11-23 16:00:42,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 16:00:42,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 16:00:42,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 16:00:42,136 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:00:42,136 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 16:00:42,136 INFO L794 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 488#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 489#L14 assume !(build_nondet_String_~length~0 < 1); 493#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 483#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 484#L14-3 assume !(build_nondet_String_~length~0 < 1); 487#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 481#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 469#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 470#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 482#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 490#L33-1 assume !cstrcspn_#t~short7; 491#L33-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5; 475#L33-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 476#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 474#L30-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 471#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 473#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 477#L33-5 [2018-11-23 16:00:42,137 INFO L796 eck$LassoCheckResult]: Loop: 477#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 478#L33-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 485#L33-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 477#L33-5 [2018-11-23 16:00:42,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:00:42,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 2 times [2018-11-23 16:00:42,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:00:42,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:00:42,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:42,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:00:42,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:42,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:00:42,160 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2018-11-23 16:00:42,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:00:42,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:00:42,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:42,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 16:00:42,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:00:42,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:00:42,172 INFO L82 PathProgramCache]: Analyzing trace with hash -238092697, now seen corresponding path program 1 times [2018-11-23 16:00:42,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:00:42,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:00:42,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:42,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 16:00:42,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:00:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:00:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 16:00:42,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 16:00:42,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd26dd80-1a33-46f1-80fe-f6e579f13cb5/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 16:00:42,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:00:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:00:42,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:00:42,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-23 16:00:42,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 16:00:42,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 16:00:42,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 16:00:42,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 16:00:42,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-11-23 16:01:14,129 WARN L180 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 16:01:40,224 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 16:01:54,972 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 16:01:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 16:01:55,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 16:01:55,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-11-23 16:01:55,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 16:01:55,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=140, Unknown=7, NotChecked=0, Total=182 [2018-11-23 16:01:55,121 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 14 states. [2018-11-23 16:01:57,784 WARN L180 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2018-11-23 16:02:00,048 WARN L180 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-11-23 16:02:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 16:02:00,109 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-23 16:02:00,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 16:02:00,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 67 transitions. [2018-11-23 16:02:00,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 16:02:00,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 45 states and 54 transitions. [2018-11-23 16:02:00,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 16:02:00,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 16:02:00,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2018-11-23 16:02:00,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 16:02:00,113 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-23 16:02:00,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2018-11-23 16:02:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2018-11-23 16:02:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 16:02:00,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-11-23 16:02:00,116 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-23 16:02:00,116 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-23 16:02:00,116 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 16:02:00,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2018-11-23 16:02:00,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 16:02:00,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 16:02:00,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 16:02:00,119 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:02:00,119 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 16:02:00,119 INFO L794 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 666#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 667#L14 assume !(build_nondet_String_~length~0 < 1); 671#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 660#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 661#L14-3 assume !(build_nondet_String_~length~0 < 1); 665#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 658#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 646#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 647#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 675#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 668#L33-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 669#L33-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5; 651#L33-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 652#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 653#L30-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 648#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 650#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 654#L33-5 [2018-11-23 16:02:00,120 INFO L796 eck$LassoCheckResult]: Loop: 654#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 655#L33-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 662#L33-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 654#L33-5 [2018-11-23 16:02:00,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:02:00,120 INFO L82 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 1 times [2018-11-23 16:02:00,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:02:00,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:02:00,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:02:00,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:02:00,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:02:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:02:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:02:00,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:02:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2018-11-23 16:02:00,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:02:00,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:02:00,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:02:00,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:02:00,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:02:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:02:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:02:00,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:02:00,156 INFO L82 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2018-11-23 16:02:00,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 16:02:00,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 16:02:00,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:02:00,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 16:02:00,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:02:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:02:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:02:00,290 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-23 16:02:00,922 WARN L180 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 156 [2018-11-23 16:02:01,676 WARN L180 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 114 [2018-11-23 16:02:01,678 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 16:02:01,678 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 16:02:01,678 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 16:02:01,678 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 16:02:01,678 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 16:02:01,679 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 16:02:01,679 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 16:02:01,679 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 16:02:01,679 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-11-23 16:02:01,679 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 16:02:01,679 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 16:02:01,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:02:01,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:02:01,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:02:01,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:02:01,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:02:01,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-23 16:02:01,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:02:01,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:02:01,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:02:01,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:02:01,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:02:01,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:02:01,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:02:01,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:02:01,842 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 16:02:02,353 WARN L180 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 100 [2018-11-23 16:02:02,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:02:02,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:02:02,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 16:02:03,242 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-11-23 16:02:03,351 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-23 16:02:03,367 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 16:02:03,367 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 16:02:03,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:02:03,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:02:03,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:02:03,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:02:03,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:02:03,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:02:03,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:02:03,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:02:03,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:02:03,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:02:03,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:02:03,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:02:03,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:02:03,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:02:03,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 16:02:03,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:02:03,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:02:03,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:02:03,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:02:03,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:02:03,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:02:03,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:02:03,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:02:03,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:02:03,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:02:03,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:02:03,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:02:03,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:02:03,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:02:03,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:02:03,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:02:03,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:02:03,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:02:03,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:02:03,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:02:03,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:02:03,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:02:03,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:02:03,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:02:03,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:02:03,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:02:03,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:02:03,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:02:03,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:02:03,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:02:03,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:02:03,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:02:03,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:02:03,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:02:03,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:02:03,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:02:03,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:02:03,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:02:03,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:02:03,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:02:03,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:02:03,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:02:03,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:02:03,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:02:03,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:02:03,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:02:03,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:02:03,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:02:03,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:02:03,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:02:03,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:02:03,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:02:03,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:02:03,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:02:03,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:02:03,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:02:03,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:02:03,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:02:03,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:02:03,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:02:03,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:02:03,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 16:02:03,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:02:03,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:02:03,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:02:03,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:02:03,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:02:03,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:02:03,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:02:03,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:02:03,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:02:03,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:02:03,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:02:03,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:02:03,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:02:03,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:02:03,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:02:03,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:02:03,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:02:03,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:02:03,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:02:03,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:02:03,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:02:03,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:02:03,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:02:03,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:02:03,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:02:03,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:02:03,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:02:03,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:02:03,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:02:03,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:02:03,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:02:03,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 16:02:03,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:02:03,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:02:03,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:02:03,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 16:02:03,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 16:02:03,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:02:03,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:02:03,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:02:03,395 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 16:02:03,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:02:03,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:02:03,396 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 16:02:03,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:02:03,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:02:03,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:02:03,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:02:03,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:02:03,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:02:03,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:02:03,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 16:02:03,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:02:03,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 16:02:03,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 16:02:03,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 16:02:03,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 16:02:03,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 16:02:03,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 16:02:03,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 16:02:03,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 16:02:03,430 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 16:02:03,455 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 16:02:03,456 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 16:02:03,456 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 16:02:03,458 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 16:02:03,458 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 16:02:03,458 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-23 16:02:03,555 INFO L297 tatePredicateManager]: 19 out of 21 supporting invariants were superfluous and have been removed [2018-11-23 16:02:03,558 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 16:02:03,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:02:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:02:03,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:02:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:02:03,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:02:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 16:02:03,640 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 16:02:03,640 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-23 16:02:03,696 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 49 states and 60 transitions. Complement of second has 7 states. [2018-11-23 16:02:03,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 16:02:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 16:02:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-23 16:02:03,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 16:02:03,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 16:02:03,698 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 16:02:03,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:02:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:02:03,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:02:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:02:03,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:02:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 16:02:03,808 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 16:02:03,808 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-23 16:02:03,878 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 49 states and 60 transitions. Complement of second has 7 states. [2018-11-23 16:02:03,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 16:02:03,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 16:02:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-23 16:02:03,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 16:02:03,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 16:02:03,879 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 16:02:03,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:02:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:02:03,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:02:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:02:03,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 16:02:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 16:02:03,962 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 16:02:03,962 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-23 16:02:04,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 48 states and 62 transitions. Complement of second has 6 states. [2018-11-23 16:02:04,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 16:02:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 16:02:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-23 16:02:04,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 16:02:04,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 16:02:04,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 21 letters. Loop has 3 letters. [2018-11-23 16:02:04,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 16:02:04,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-23 16:02:04,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 16:02:04,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2018-11-23 16:02:04,031 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 16:02:04,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2018-11-23 16:02:04,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 16:02:04,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 16:02:04,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 16:02:04,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 16:02:04,032 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 16:02:04,032 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 16:02:04,032 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 16:02:04,032 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 16:02:04,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 16:02:04,033 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 16:02:04,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 16:02:04,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 04:02:04 BoogieIcfgContainer [2018-11-23 16:02:04,038 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 16:02:04,039 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 16:02:04,039 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 16:02:04,039 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 16:02:04,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:00:37" (3/4) ... [2018-11-23 16:02:04,043 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 16:02:04,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 16:02:04,044 INFO L168 Benchmark]: Toolchain (without parser) took 86970.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 271.6 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -99.9 MB). Peak memory consumption was 171.7 MB. Max. memory is 11.5 GB. [2018-11-23 16:02:04,045 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 16:02:04,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.56 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 16:02:04,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.09 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 16:02:04,047 INFO L168 Benchmark]: Boogie Preprocessor took 67.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-23 16:02:04,047 INFO L168 Benchmark]: RCFGBuilder took 241.62 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: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2018-11-23 16:02:04,048 INFO L168 Benchmark]: BuchiAutomizer took 86395.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 134.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.8 MB). Peak memory consumption was 188.5 MB. Max. memory is 11.5 GB. [2018-11-23 16:02:04,049 INFO L168 Benchmark]: Witness Printer took 4.59 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 16:02:04,054 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 226.56 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.09 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 241.62 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: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 86395.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 134.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.8 MB). Peak memory consumption was 188.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.59 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[build_nondet_String()] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 86.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 80.2s. Construction of modules took 0.3s. Büchi inclusion checks took 5.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 128 SDtfs, 187 SDslu, 188 SDs, 0 SdLazy, 297 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital346 mio100 ax100 hnf99 lsp91 ukn75 mio100 lsp29 div129 bol100 ite100 ukn100 eq166 hnf80 smp91 dnf844 smp50 tf100 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...