./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dcacf41a-a707-4409-8c24-4571be4f73ef/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dcacf41a-a707-4409-8c24-4571be4f73ef/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dcacf41a-a707-4409-8c24-4571be4f73ef/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dcacf41a-a707-4409-8c24-4571be4f73ef/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_dcacf41a-a707-4409-8c24-4571be4f73ef/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dcacf41a-a707-4409-8c24-4571be4f73ef/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 32bit --witnessprinter.graph.data.programhash bae2699bcd2830a9f6fd8179c1786410249a39fb ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:08:53,316 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:08:53,317 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:08:53,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:08:53,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:08:53,326 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:08:53,327 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:08:53,328 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:08:53,329 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:08:53,330 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:08:53,330 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:08:53,331 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:08:53,331 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:08:53,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:08:53,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:08:53,333 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:08:53,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:08:53,335 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:08:53,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:08:53,338 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:08:53,339 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:08:53,340 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:08:53,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:08:53,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:08:53,342 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:08:53,343 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:08:53,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:08:53,344 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:08:53,345 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:08:53,345 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:08:53,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:08:53,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:08:53,346 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:08:53,347 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:08:53,347 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:08:53,348 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:08:53,348 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dcacf41a-a707-4409-8c24-4571be4f73ef/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 04:08:53,359 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:08:53,359 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:08:53,360 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:08:53,360 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:08:53,360 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:08:53,360 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:08:53,361 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:08:53,361 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:08:53,361 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:08:53,361 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:08:53,361 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:08:53,361 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:08:53,361 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:08:53,361 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:08:53,362 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:08:53,362 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:08:53,362 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:08:53,362 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:08:53,362 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:08:53,362 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:08:53,362 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:08:53,363 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:08:53,363 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:08:53,363 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:08:53,363 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:08:53,363 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:08:53,363 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:08:53,363 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:08:53,364 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:08:53,364 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:08:53,364 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:08:53,364 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_dcacf41a-a707-4409-8c24-4571be4f73ef/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bae2699bcd2830a9f6fd8179c1786410249a39fb [2018-11-10 04:08:53,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:08:53,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:08:53,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:08:53,403 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:08:53,403 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:08:53,403 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dcacf41a-a707-4409-8c24-4571be4f73ef/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-10 04:08:53,449 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dcacf41a-a707-4409-8c24-4571be4f73ef/bin-2019/uautomizer/data/b781a319e/fb76ec65fa9e4e84a7cdd0ba62f3241a/FLAGecb43ae07 [2018-11-10 04:08:53,797 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:08:53,797 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dcacf41a-a707-4409-8c24-4571be4f73ef/sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-10 04:08:53,804 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dcacf41a-a707-4409-8c24-4571be4f73ef/bin-2019/uautomizer/data/b781a319e/fb76ec65fa9e4e84a7cdd0ba62f3241a/FLAGecb43ae07 [2018-11-10 04:08:53,814 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dcacf41a-a707-4409-8c24-4571be4f73ef/bin-2019/uautomizer/data/b781a319e/fb76ec65fa9e4e84a7cdd0ba62f3241a [2018-11-10 04:08:53,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:08:53,817 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:08:53,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:08:53,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:08:53,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:08:53,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:08:53" (1/1) ... [2018-11-10 04:08:53,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4205049b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:53, skipping insertion in model container [2018-11-10 04:08:53,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:08:53" (1/1) ... [2018-11-10 04:08:53,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:08:53,856 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:08:54,031 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:08:54,039 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:08:54,062 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:08:54,094 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:08:54,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:54 WrapperNode [2018-11-10 04:08:54,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:08:54,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:08:54,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:08:54,096 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:08:54,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:54" (1/1) ... [2018-11-10 04:08:54,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:54" (1/1) ... [2018-11-10 04:08:54,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:08:54,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:08:54,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:08:54,173 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:08:54,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:54" (1/1) ... [2018-11-10 04:08:54,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:54" (1/1) ... [2018-11-10 04:08:54,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:54" (1/1) ... [2018-11-10 04:08:54,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:54" (1/1) ... [2018-11-10 04:08:54,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:54" (1/1) ... [2018-11-10 04:08:54,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:54" (1/1) ... [2018-11-10 04:08:54,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:54" (1/1) ... [2018-11-10 04:08:54,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:08:54,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:08:54,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:08:54,190 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:08:54,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dcacf41a-a707-4409-8c24-4571be4f73ef/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-10 04:08:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 04:08:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 04:08:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:08:54,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:08:54,450 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:08:54,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:08:54 BoogieIcfgContainer [2018-11-10 04:08:54,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:08:54,451 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:08:54,451 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:08:54,454 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:08:54,455 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:08:54,455 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:08:53" (1/3) ... [2018-11-10 04:08:54,456 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46f0dd40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:08:54, skipping insertion in model container [2018-11-10 04:08:54,457 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:08:54,457 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:08:54" (2/3) ... [2018-11-10 04:08:54,457 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46f0dd40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:08:54, skipping insertion in model container [2018-11-10 04:08:54,457 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:08:54,457 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:08:54" (3/3) ... [2018-11-10 04:08:54,459 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-10 04:08:54,508 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:08:54,509 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:08:54,509 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:08:54,509 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:08:54,509 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:08:54,509 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:08:54,509 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:08:54,509 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:08:54,509 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:08:54,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-10 04:08:54,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 04:08:54,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:08:54,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:08:54,547 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:08:54,547 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:08:54,547 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:08:54,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-10 04:08:54,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 04:08:54,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:08:54,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:08:54,549 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:08:54,549 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:08:54,555 INFO L793 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 9#L555true assume !(main_~length1~0 < 1); 14#L555-2true assume !(main_~length2~0 < 1); 4#L558-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 17#L563true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L563 19#L563-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L563-1 13#L564true assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 23#L549true [2018-11-10 04:08:54,556 INFO L795 eck$LassoCheckResult]: Loop: 23#L549true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1; 5#L546true SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1); srcloc: L546 7#L546-1true cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;havoc cstrspn_#t~mem3;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 15#L547-5true assume true;cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, cstrspn_#t~post4.offset + 1; 6#L547-1true SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1); srcloc: L547-1 8#L547-2true cstrspn_~sc~0 := cstrspn_#t~mem5; 10#L547-3true assume !!(cstrspn_~sc~0 != 0);havoc cstrspn_#t~mem5;havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset; 3#L548true assume cstrspn_~sc~0 == cstrspn_~c~0; 23#L549true [2018-11-10 04:08:54,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:54,560 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 04:08:54,562 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:54,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:54,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:54,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:54,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:54,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:54,687 INFO L82 PathProgramCache]: Analyzing trace with hash 801407178, now seen corresponding path program 1 times [2018-11-10 04:08:54,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:54,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:54,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:54,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:54,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:54,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:54,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1358744052, now seen corresponding path program 1 times [2018-11-10 04:08:54,707 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:54,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:54,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:54,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:54,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:54,877 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-10 04:08:55,167 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-11-10 04:08:55,268 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:08:55,268 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:08:55,269 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:08:55,269 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:08:55,269 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:08:55,269 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:08:55,269 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:08:55,269 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:08:55,269 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-10 04:08:55,269 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:08:55,270 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:08:55,290 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-10 04:08:55,297 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-10 04:08:55,300 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-10 04:08:55,310 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-10 04:08:55,313 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-10 04:08:55,318 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-10 04:08:55,320 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-10 04:08:55,322 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-10 04:08:55,324 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-10 04:08:55,325 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-10 04:08:55,611 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2018-11-10 04:08:55,736 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-11-10 04:08:55,736 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-10 04:08:55,737 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-10 04:08:55,739 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-10 04:08:55,740 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-10 04:08:56,122 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:08:56,125 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:08:56,127 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-10 04:08:56,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:56,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:56,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:56,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:56,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:56,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:56,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:56,132 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:56,132 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-10 04:08:56,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:56,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:56,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:56,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:56,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:56,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:56,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:56,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:56,135 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-10 04:08:56,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:56,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:56,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:56,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:56,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:56,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:56,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:56,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:56,137 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-10 04:08:56,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:56,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:56,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:56,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:56,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:56,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:56,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:56,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:56,139 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-10 04:08:56,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:56,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:56,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:56,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:56,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:56,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:56,145 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:56,145 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-10 04:08:56,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:56,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:56,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:56,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:56,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:56,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:56,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:56,148 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:56,148 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-10 04:08:56,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:56,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:56,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:56,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:56,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:56,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:56,156 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:56,156 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-10 04:08:56,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:56,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:56,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:56,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:56,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:56,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:56,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:56,161 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:56,161 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-10 04:08:56,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:56,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:56,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:56,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:56,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:56,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:56,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:56,165 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:56,166 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-10 04:08:56,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:56,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:56,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:56,168 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 04:08:56,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:56,169 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 04:08:56,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:56,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:56,179 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-10 04:08:56,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:56,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:56,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:56,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:56,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:56,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:56,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:56,195 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-10 04:08:56,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:56,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:56,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:56,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:56,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:56,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:56,200 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:56,200 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-10 04:08:56,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:56,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:56,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:56,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:56,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:56,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:56,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:56,209 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-10 04:08:56,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:56,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:56,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:56,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:56,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:56,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:56,276 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:08:56,319 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 04:08:56,319 INFO L444 ModelExtractionUtils]: 51 out of 58 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 04:08:56,321 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:08:56,323 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:08:56,324 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:08:56,324 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~p~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -1*ULTIMATE.start_cstrspn_~p~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [] [2018-11-10 04:08:56,366 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-10 04:08:56,373 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:08:56,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:56,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:56,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:56,473 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-10 04:08:56,483 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 04:08:56,484 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 5 states. [2018-11-10 04:08:56,564 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 5 states. Result 38 states and 42 transitions. Complement of second has 9 states. [2018-11-10 04:08:56,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:08:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 04:08:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-10 04:08:56,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-10 04:08:56,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:56,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-10 04:08:56,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:56,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 16 letters. [2018-11-10 04:08:56,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:56,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2018-11-10 04:08:56,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:08:56,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 23 states and 27 transitions. [2018-11-10 04:08:56,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 04:08:56,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 04:08:56,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-10 04:08:56,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:08:56,574 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 04:08:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-10 04:08:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-10 04:08:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 04:08:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-10 04:08:56,593 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 04:08:56,593 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 04:08:56,593 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:08:56,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2018-11-10 04:08:56,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:08:56,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:08:56,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:08:56,594 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:08:56,594 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:08:56,594 INFO L793 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 223#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 219#L555 assume !(main_~length1~0 < 1); 220#L555-2 assume !(main_~length2~0 < 1); 209#L558-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 210#L563 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L563 225#L563-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L563-1 221#L564 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 222#L549 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1; 211#L546 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1); srcloc: L546 212#L546-1 cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;havoc cstrspn_#t~mem3;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 205#L547-5 [2018-11-10 04:08:56,594 INFO L795 eck$LassoCheckResult]: Loop: 205#L547-5 assume true;cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, cstrspn_#t~post4.offset + 1; 213#L547-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1); srcloc: L547-1 214#L547-2 cstrspn_~sc~0 := cstrspn_#t~mem5; 217#L547-3 assume !!(cstrspn_~sc~0 != 0);havoc cstrspn_#t~mem5;havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset; 204#L548 assume !(cstrspn_~sc~0 == cstrspn_~c~0); 205#L547-5 [2018-11-10 04:08:56,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:56,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2052449962, now seen corresponding path program 1 times [2018-11-10 04:08:56,594 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:56,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:56,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:56,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:56,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:56,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:56,617 INFO L82 PathProgramCache]: Analyzing trace with hash 53473023, now seen corresponding path program 1 times [2018-11-10 04:08:56,617 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:56,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:56,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:56,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:56,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:56,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:56,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1358744054, now seen corresponding path program 1 times [2018-11-10 04:08:56,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:56,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:56,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:56,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:56,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:56,941 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 113 [2018-11-10 04:08:57,030 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:08:57,030 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:08:57,030 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:08:57,030 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:08:57,030 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:08:57,030 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:08:57,030 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:08:57,031 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:08:57,031 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-10 04:08:57,031 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:08:57,031 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:08:57,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:57,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:08:57,036 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-10 04:08:57,037 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-10 04:08:57,037 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-10 04:08:57,038 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-10 04:08:57,040 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-10 04:08:57,040 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-10 04:08:57,041 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-10 04:08:57,042 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-10 04:08:57,044 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-10 04:08:57,045 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-10 04:08:57,046 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-10 04:08:57,047 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-10 04:08:57,285 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2018-11-10 04:08:57,342 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-10 04:08:57,672 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:08:57,672 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:08:57,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:57,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:57,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:57,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:57,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,675 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-10 04:08:57,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:57,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:57,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:57,676 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,676 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-10 04:08:57,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:57,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:57,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:57,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,678 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-10 04:08:57,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:57,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:57,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:57,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,683 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-10 04:08:57,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:57,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:57,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:57,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:57,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:57,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:57,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:57,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:57,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:57,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:57,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,690 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-10 04:08:57,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:57,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:57,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:57,691 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,692 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-10 04:08:57,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:57,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:57,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:57,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,694 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-10 04:08:57,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:57,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:57,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,697 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-10 04:08:57,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:57,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:57,700 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,700 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-10 04:08:57,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:57,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:57,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:57,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:57,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:57,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:57,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:57,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,705 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-10 04:08:57,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:57,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:57,716 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,717 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-10 04:08:57,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:57,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:57,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,720 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-10 04:08:57,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:57,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:57,728 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,729 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-10 04:08:57,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:57,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:57,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,738 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-10 04:08:57,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:57,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:57,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,743 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-10 04:08:57,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,743 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:08:57,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,745 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:08:57,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:57,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,753 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-10 04:08:57,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:57,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:57,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,757 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-10 04:08:57,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,757 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-10 04:08:57,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,766 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-11-10 04:08:57,766 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-10 04:08:57,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:08:57,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:57,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:57,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,814 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-10 04:08:57,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,814 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:08:57,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,816 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:08:57,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:57,824 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:57,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-10 04:08:57,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:57,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:57,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:57,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:57,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:57,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:57,845 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:08:57,857 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 04:08:57,857 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 04:08:57,857 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:08:57,858 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:08:57,858 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:08:57,858 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~spanp~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2) = -1*ULTIMATE.start_cstrspn_~spanp~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 Supporting invariants [] [2018-11-10 04:08:57,901 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2018-11-10 04:08:57,903 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:08:57,904 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:08:57,904 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 04:08:57,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:57,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:57,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:58,008 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-10 04:08:58,008 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 04:08:58,008 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-10 04:08:58,077 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 51 states and 59 transitions. Complement of second has 9 states. [2018-11-10 04:08:58,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:08:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 04:08:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 04:08:58,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-10 04:08:58,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:58,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-10 04:08:58,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:58,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-10 04:08:58,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:58,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2018-11-10 04:08:58,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:08:58,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 35 states and 41 transitions. [2018-11-10 04:08:58,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 04:08:58,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 04:08:58,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2018-11-10 04:08:58,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:08:58,082 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-10 04:08:58,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2018-11-10 04:08:58,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-10 04:08:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 04:08:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-10 04:08:58,084 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-10 04:08:58,084 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-10 04:08:58,084 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:08:58,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2018-11-10 04:08:58,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:08:58,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:08:58,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:08:58,085 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:08:58,085 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:08:58,086 INFO L793 eck$LassoCheckResult]: Stem: 440#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 436#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 433#L555 assume !(main_~length1~0 < 1); 434#L555-2 assume !(main_~length2~0 < 1); 422#L558-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 423#L563 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L563 441#L563-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L563-1 437#L564 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 438#L549 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1; 442#L546 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1); srcloc: L546 430#L546-1 cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;havoc cstrspn_#t~mem3;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 421#L547-5 assume true;cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, cstrspn_#t~post4.offset + 1; 448#L547-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1); srcloc: L547-1 446#L547-2 cstrspn_~sc~0 := cstrspn_#t~mem5; 447#L547-3 assume !!(cstrspn_~sc~0 != 0);havoc cstrspn_#t~mem5;havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset; 444#L548 assume cstrspn_~sc~0 == cstrspn_~c~0; 443#L549 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1; 424#L546 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1); srcloc: L546 425#L546-1 cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;havoc cstrspn_#t~mem3;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 419#L547-5 [2018-11-10 04:08:58,086 INFO L795 eck$LassoCheckResult]: Loop: 419#L547-5 assume true;cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, cstrspn_#t~post4.offset + 1; 426#L547-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1); srcloc: L547-1 427#L547-2 cstrspn_~sc~0 := cstrspn_#t~mem5; 431#L547-3 assume !!(cstrspn_~sc~0 != 0);havoc cstrspn_#t~mem5;havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset; 418#L548 assume !(cstrspn_~sc~0 == cstrspn_~c~0); 419#L547-5 [2018-11-10 04:08:58,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:58,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1722691775, now seen corresponding path program 2 times [2018-11-10 04:08:58,086 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:58,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:58,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:58,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:58,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:58,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:58,106 INFO L82 PathProgramCache]: Analyzing trace with hash 53473023, now seen corresponding path program 2 times [2018-11-10 04:08:58,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:58,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:58,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:58,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:08:58,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:58,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:58,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1021159359, now seen corresponding path program 1 times [2018-11-10 04:08:58,112 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:08:58,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:08:58,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:58,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:08:58,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:08:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:58,634 WARN L179 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 150 [2018-11-10 04:08:58,748 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-10 04:08:58,749 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:08:58,750 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:08:58,750 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:08:58,750 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:08:58,750 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:08:58,750 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:08:58,750 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:08:58,750 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:08:58,750 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-10 04:08:58,750 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:08:58,750 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:08:58,753 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-10 04:08:58,755 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-10 04:08:58,758 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-10 04:08:59,068 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2018-11-10 04:08:59,152 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-10 04:08:59,153 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-10 04:08:59,154 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-10 04:08:59,155 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-10 04:08:59,157 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-10 04:08:59,158 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-10 04:08:59,159 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-10 04:08:59,159 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-10 04:08:59,161 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-10 04:08:59,162 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-10 04:08:59,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-10 04:08:59,164 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-10 04:08:59,515 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:08:59,515 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:08:59,515 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-10 04:08:59,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:59,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:08:59,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:59,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:59,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:59,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:08:59,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:08:59,517 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:59,518 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-10 04:08:59,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:59,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:59,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:59,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:59,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:59,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:59,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:59,520 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-10 04:08:59,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:59,521 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:08:59,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:59,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:59,522 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:08:59,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:59,527 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:08:59,527 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-10 04:08:59,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:08:59,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:08:59,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:08:59,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:08:59,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:08:59,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:08:59,547 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:08:59,558 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:08:59,558 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 04:08:59,559 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:08:59,559 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:08:59,560 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:08:59,560 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_cstrspn_~spanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_cstrspn_~spanp~0.offset Supporting invariants [] [2018-11-10 04:08:59,657 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2018-11-10 04:08:59,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:08:59,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:59,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:59,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:59,750 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-10 04:08:59,751 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 04:08:59,751 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 04:08:59,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 44 states and 51 transitions. Complement of second has 8 states. [2018-11-10 04:08:59,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:08:59,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 04:08:59,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-10 04:08:59,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 19 letters. Loop has 5 letters. [2018-11-10 04:08:59,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:59,805 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:08:59,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:59,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:59,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:59,873 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-10 04:08:59,873 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 04:08:59,874 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 04:08:59,924 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 43 states and 49 transitions. Complement of second has 10 states. [2018-11-10 04:08:59,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 04:08:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 04:08:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-10 04:08:59,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 19 letters. Loop has 5 letters. [2018-11-10 04:08:59,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:08:59,925 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:08:59,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:59,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:08:59,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:08:59,980 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-10 04:08:59,980 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 04:08:59,980 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 04:09:00,012 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 52 states and 60 transitions. Complement of second has 7 states. [2018-11-10 04:09:00,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:09:00,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 04:09:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-10 04:09:00,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 19 letters. Loop has 5 letters. [2018-11-10 04:09:00,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:09:00,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 24 letters. Loop has 5 letters. [2018-11-10 04:09:00,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:09:00,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 19 letters. Loop has 10 letters. [2018-11-10 04:09:00,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:09:00,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2018-11-10 04:09:00,016 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:09:00,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 0 states and 0 transitions. [2018-11-10 04:09:00,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:09:00,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:09:00,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:09:00,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:09:00,017 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:09:00,017 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:09:00,017 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:09:00,017 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:09:00,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:09:00,017 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:09:00,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 04:09:00,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:09:00 BoogieIcfgContainer [2018-11-10 04:09:00,022 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:09:00,022 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:09:00,022 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:09:00,022 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:09:00,022 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:08:54" (3/4) ... [2018-11-10 04:09:00,025 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:09:00,025 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:09:00,025 INFO L168 Benchmark]: Toolchain (without parser) took 6209.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.2 MB). Free memory was 957.6 MB in the beginning and 965.6 MB in the end (delta: -7.9 MB). Peak memory consumption was 222.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:09:00,026 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:09:00,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.83 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 932.4 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:09:00,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 932.4 MB in the beginning and 1.1 GB in the end (delta: -204.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:09:00,027 INFO L168 Benchmark]: Boogie Preprocessor took 16.76 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:09:00,028 INFO L168 Benchmark]: RCFGBuilder took 260.99 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.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:09:00,028 INFO L168 Benchmark]: BuchiAutomizer took 5570.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 965.6 MB in the end (delta: 146.7 MB). Peak memory consumption was 236.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:09:00,028 INFO L168 Benchmark]: Witness Printer took 2.83 ms. Allocated memory is still 1.3 GB. Free memory is still 965.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:09:00,031 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.83 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 932.4 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 932.4 MB in the beginning and 1.1 GB in the end (delta: -204.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.76 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 260.99 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.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5570.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 965.6 MB in the end (delta: 146.7 MB). Peak memory consumption was 236.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.83 ms. Allocated memory is still 1.3 GB. Free memory is still 965.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * 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 #Ultimate.alloc_#res - 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 3 terminating modules (0 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * p + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 6 locations. One deterministic module has affine ranking function -1 * spanp + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * spanp and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 4.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 91 SDtfs, 123 SDslu, 77 SDs, 0 SdLazy, 72 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital227 mio100 ax100 hnf99 lsp96 ukn102 mio100 lsp33 div100 bol100 ite100 ukn100 eq195 hnf88 smp96 dnf100 smp100 tf100 neg99 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 52ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 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...