./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9587b1c7-6ff4-457a-a7b2-d5eaccb17730/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9587b1c7-6ff4-457a-a7b2-d5eaccb17730/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9587b1c7-6ff4-457a-a7b2-d5eaccb17730/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9587b1c7-6ff4-457a-a7b2-d5eaccb17730/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9587b1c7-6ff4-457a-a7b2-d5eaccb17730/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9587b1c7-6ff4-457a-a7b2-d5eaccb17730/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f39f60c3148e6a8957b92a35d12d506fd8229368 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:09:08,285 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:09:08,287 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:09:08,296 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:09:08,296 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:09:08,297 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:09:08,298 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:09:08,299 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:09:08,301 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:09:08,302 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:09:08,303 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:09:08,303 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:09:08,303 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:09:08,307 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:09:08,307 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:09:08,308 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:09:08,309 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:09:08,310 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:09:08,311 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:09:08,321 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:09:08,322 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:09:08,325 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:09:08,328 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:09:08,331 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:09:08,332 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:09:08,332 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:09:08,333 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:09:08,333 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:09:08,334 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:09:08,334 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:09:08,334 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:09:08,335 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:09:08,335 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:09:08,335 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:09:08,335 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:09:08,336 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:09:08,336 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9587b1c7-6ff4-457a-a7b2-d5eaccb17730/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:09:08,350 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:09:08,350 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:09:08,351 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:09:08,351 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:09:08,352 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:09:08,352 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:09:08,352 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:09:08,352 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:09:08,353 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:09:08,353 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:09:08,353 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:09:08,353 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:09:08,354 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:09:08,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:09:08,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:09:08,354 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:09:08,354 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:09:08,354 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:09:08,355 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:09:08,355 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:09:08,355 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:09:08,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:09:08,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:09:08,355 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:09:08,356 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:09:08,356 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:09:08,356 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:09:08,359 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:09:08,359 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_9587b1c7-6ff4-457a-a7b2-d5eaccb17730/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f39f60c3148e6a8957b92a35d12d506fd8229368 [2018-10-27 06:09:08,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:09:08,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:09:08,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:09:08,399 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:09:08,400 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:09:08,401 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9587b1c7-6ff4-457a-a7b2-d5eaccb17730/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c [2018-10-27 06:09:08,447 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9587b1c7-6ff4-457a-a7b2-d5eaccb17730/bin-2019/uautomizer/data/e48e127d5/842829a27c7a4bdbbeed7e41e1ee699b/FLAG146aaca9b [2018-10-27 06:09:08,829 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:09:08,830 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9587b1c7-6ff4-457a-a7b2-d5eaccb17730/sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c [2018-10-27 06:09:08,836 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9587b1c7-6ff4-457a-a7b2-d5eaccb17730/bin-2019/uautomizer/data/e48e127d5/842829a27c7a4bdbbeed7e41e1ee699b/FLAG146aaca9b [2018-10-27 06:09:08,848 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9587b1c7-6ff4-457a-a7b2-d5eaccb17730/bin-2019/uautomizer/data/e48e127d5/842829a27c7a4bdbbeed7e41e1ee699b [2018-10-27 06:09:08,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:09:08,853 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:09:08,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:08,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:09:08,857 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:09:08,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:08" (1/1) ... [2018-10-27 06:09:08,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6408abce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:08, skipping insertion in model container [2018-10-27 06:09:08,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:08" (1/1) ... [2018-10-27 06:09:08,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:09:08,885 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:09:09,002 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:09,009 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:09:09,022 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:09,036 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:09:09,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:09 WrapperNode [2018-10-27 06:09:09,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:09,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:09,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:09:09,037 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:09:09,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:09" (1/1) ... [2018-10-27 06:09:09,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:09" (1/1) ... [2018-10-27 06:09:09,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:09,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:09:09,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:09:09,070 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:09:09,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:09" (1/1) ... [2018-10-27 06:09:09,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:09" (1/1) ... [2018-10-27 06:09:09,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:09" (1/1) ... [2018-10-27 06:09:09,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:09" (1/1) ... [2018-10-27 06:09:09,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:09" (1/1) ... [2018-10-27 06:09:09,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:09" (1/1) ... [2018-10-27 06:09:09,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:09" (1/1) ... [2018-10-27 06:09:09,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:09:09,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:09:09,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:09:09,096 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:09:09,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9587b1c7-6ff4-457a-a7b2-d5eaccb17730/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-10-27 06:09:09,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:09:09,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:09:09,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:09:09,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:09:09,761 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:09:09,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:09 BoogieIcfgContainer [2018-10-27 06:09:09,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:09:09,762 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:09:09,762 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:09:09,766 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:09:09,767 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:09,767 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:09:08" (1/3) ... [2018-10-27 06:09:09,768 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ae8b2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:09, skipping insertion in model container [2018-10-27 06:09:09,769 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:09,769 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:09" (2/3) ... [2018-10-27 06:09:09,769 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ae8b2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:09, skipping insertion in model container [2018-10-27 06:09:09,769 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:09,769 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:09" (3/3) ... [2018-10-27 06:09:09,771 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_true-termination_true-no-overflow.c [2018-10-27 06:09:09,823 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:09:09,824 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:09:09,824 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:09:09,824 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:09:09,824 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:09:09,825 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:09:09,825 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:09:09,825 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:09:09,825 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:09:09,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-10-27 06:09:09,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:09:09,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:09,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:09,869 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:09,869 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:09,869 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:09:09,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-10-27 06:09:09,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:09:09,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:09,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:09,872 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:09,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:09,881 INFO L793 eck$LassoCheckResult]: Stem: 30#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~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 21#L14true assume !(build_nondet_String_~length~0 < 1); 16#L14-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 9#L18true SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 7#L18-1true build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 26#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 15#L14-3true assume !(build_nondet_String_~length~0 < 1); 27#L14-5true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 5#L18-2true SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 3#L18-3true build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 24#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 34#L30-5true [2018-10-27 06:09:09,881 INFO L795 eck$LassoCheckResult]: Loop: 34#L30-5true assume true; 25#L30-1true SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L30-1 23#L30-2true assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 14#L32true SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L32 13#L32-1true cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 19#L33-9true assume !true; 18#L33-10true SUMMARY for call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-10 33#L35true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 22#L30-4true cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 34#L30-5true [2018-10-27 06:09:09,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:09,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1755105166, now seen corresponding path program 1 times [2018-10-27 06:09:09,893 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:09,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:09,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:09,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:09,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:10,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:10,043 INFO L82 PathProgramCache]: Analyzing trace with hash 883669989, now seen corresponding path program 1 times [2018-10-27 06:09:10,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:10,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:10,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:10,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:10,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:10,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:10,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:09:10,083 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:10,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:09:10,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:09:10,100 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-10-27 06:09:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:10,108 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-10-27 06:09:10,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:09:10,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2018-10-27 06:09:10,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:09:10,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 31 transitions. [2018-10-27 06:09:10,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-10-27 06:09:10,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-10-27 06:09:10,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-10-27 06:09:10,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:10,119 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-10-27 06:09:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-10-27 06:09:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-27 06:09:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-27 06:09:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-10-27 06:09:10,147 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-10-27 06:09:10,147 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-10-27 06:09:10,147 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:09:10,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-10-27 06:09:10,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:09:10,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:10,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:10,149 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:10,149 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:10,149 INFO L793 eck$LassoCheckResult]: Stem: 98#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 84#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 85#L14 assume !(build_nondet_String_~length~0 < 1); 90#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 81#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 78#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 79#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 88#L14-3 assume !(build_nondet_String_~length~0 < 1); 89#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 77#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 72#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 73#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 94#L30-5 [2018-10-27 06:09:10,149 INFO L795 eck$LassoCheckResult]: Loop: 94#L30-5 assume true; 96#L30-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L30-1 95#L30-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 87#L32 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L32 86#L32-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 76#L33-9 assume true; 92#L33-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-1 97#L33-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 83#L33-3 assume !cstrcspn_#t~short7; 74#L33-7 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5; 75#L33-10 SUMMARY for call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-10 91#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 93#L30-4 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 94#L30-5 [2018-10-27 06:09:10,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:10,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1755105166, now seen corresponding path program 2 times [2018-10-27 06:09:10,150 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:10,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:10,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:10,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:10,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:10,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:10,199 INFO L82 PathProgramCache]: Analyzing trace with hash 311113554, now seen corresponding path program 1 times [2018-10-27 06:09:10,201 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:10,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:10,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:10,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:10,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:10,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:10,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1448205541, now seen corresponding path program 1 times [2018-10-27 06:09:10,231 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:10,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:10,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:10,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:10,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:10,670 WARN L179 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-10-27 06:09:11,713 WARN L179 SmtUtils]: Spent 964.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2018-10-27 06:09:11,861 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-10-27 06:09:11,871 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:11,872 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:11,872 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:11,873 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:11,873 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:11,873 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:11,873 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:11,874 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:11,874 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration2_Lasso [2018-10-27 06:09:11,874 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:11,875 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:11,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:11,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:12,362 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2018-10-27 06:09:12,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:12,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:12,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:12,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:12,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:12,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:12,774 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 06:09:13,001 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:13,006 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:13,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:13,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:13,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:13,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:13,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:13,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:13,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:13,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:13,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:13,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:13,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:13,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:13,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,024 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-10-27 06:09:13,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:13,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:13,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:13,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,030 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-10-27 06:09:13,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:13,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:13,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,039 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-10-27 06:09:13,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:13,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:13,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:13,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,042 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-10-27 06:09:13,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:13,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:13,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:13,048 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,049 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-10-27 06:09:13,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:13,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:13,056 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,057 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-10-27 06:09:13,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:13,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:13,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:13,059 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,059 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-10-27 06:09:13,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:13,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:13,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:13,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,066 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-10-27 06:09:13,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:13,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:13,073 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,074 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-10-27 06:09:13,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:13,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:13,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:13,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:13,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:13,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:13,087 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,087 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-10-27 06:09:13,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:13,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:13,117 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,117 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-10-27 06:09:13,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:13,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:13,152 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,153 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-10-27 06:09:13,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:13,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,154 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:13,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,155 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:13,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:13,163 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,163 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-10-27 06:09:13,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:13,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:13,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,171 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-10-27 06:09:13,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:13,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:13,177 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,178 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-10-27 06:09:13,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:13,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:13,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:13,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,184 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-10-27 06:09:13,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,184 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:13,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,187 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:13,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:13,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:13,207 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-10-27 06:09:13,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:13,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:13,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:13,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:13,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:13,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:13,252 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:13,274 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:09:13,274 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:09:13,276 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:13,278 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:13,278 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:13,279 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2018-10-27 06:09:13,340 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-10-27 06:09:13,346 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:09:13,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:13,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:13,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:13,460 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:09:13,461 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-10-27 06:09:13,527 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 42 states and 49 transitions. Complement of second has 6 states. [2018-10-27 06:09:13,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:09:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-10-27 06:09:13,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 12 letters. Loop has 13 letters. [2018-10-27 06:09:13,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:13,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 25 letters. Loop has 13 letters. [2018-10-27 06:09:13,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:13,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 12 letters. Loop has 26 letters. [2018-10-27 06:09:13,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:13,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2018-10-27 06:09:13,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:13,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 39 states and 46 transitions. [2018-10-27 06:09:13,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-10-27 06:09:13,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-10-27 06:09:13,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2018-10-27 06:09:13,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:13,537 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-10-27 06:09:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2018-10-27 06:09:13,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-27 06:09:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-27 06:09:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-10-27 06:09:13,542 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-10-27 06:09:13,542 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-10-27 06:09:13,542 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:09:13,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-10-27 06:09:13,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:13,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:13,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:13,544 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:13,544 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:09:13,544 INFO L793 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 289#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 290#L14 assume !(build_nondet_String_~length~0 < 1); 297#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 284#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 280#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 281#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 295#L14-3 assume !(build_nondet_String_~length~0 < 1); 296#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 279#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 272#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 273#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 305#L30-5 assume true; 306#L30-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L30-1 303#L30-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 293#L32 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L32 291#L32-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 275#L33-9 [2018-10-27 06:09:13,544 INFO L795 eck$LassoCheckResult]: Loop: 275#L33-9 assume true; 299#L33-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-1 308#L33-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 287#L33-3 assume !cstrcspn_#t~short7; 274#L33-7 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset + 1;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 275#L33-9 [2018-10-27 06:09:13,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:13,550 INFO L82 PathProgramCache]: Analyzing trace with hash 556795412, now seen corresponding path program 1 times [2018-10-27 06:09:13,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:13,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:13,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:13,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:13,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:13,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:13,579 INFO L82 PathProgramCache]: Analyzing trace with hash 66864142, now seen corresponding path program 1 times [2018-10-27 06:09:13,579 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:13,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:13,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:13,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:13,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:13,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:13,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:09:13,657 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:13,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:09:13,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:09:13,658 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-10-27 06:09:13,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:13,718 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-10-27 06:09:13,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:09:13,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2018-10-27 06:09:13,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:13,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 46 transitions. [2018-10-27 06:09:13,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-10-27 06:09:13,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-10-27 06:09:13,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2018-10-27 06:09:13,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:13,721 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-10-27 06:09:13,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2018-10-27 06:09:13,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-27 06:09:13,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-27 06:09:13,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-10-27 06:09:13,723 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-10-27 06:09:13,723 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-10-27 06:09:13,723 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:09:13,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2018-10-27 06:09:13,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:13,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:13,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:13,724 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:13,725 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:13,725 INFO L793 eck$LassoCheckResult]: Stem: 397#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 378#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 379#L14 assume !(build_nondet_String_~length~0 < 1); 384#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 370#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 365#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 366#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 382#L14-3 assume !(build_nondet_String_~length~0 < 1); 383#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 364#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 358#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 359#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 392#L30-5 assume true; 393#L30-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L30-1 390#L30-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 380#L32 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L32 375#L32-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 361#L33-9 [2018-10-27 06:09:13,725 INFO L795 eck$LassoCheckResult]: Loop: 361#L33-9 assume true; 386#L33-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-1 395#L33-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 373#L33-3 assume cstrcspn_#t~short7; 371#L33-4 SUMMARY for call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-4 367#L33-5 cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 360#L33-7 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset + 1;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 361#L33-9 [2018-10-27 06:09:13,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:13,725 INFO L82 PathProgramCache]: Analyzing trace with hash 556795412, now seen corresponding path program 2 times [2018-10-27 06:09:13,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:13,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:13,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:13,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:13,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:13,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:13,772 INFO L82 PathProgramCache]: Analyzing trace with hash -168195247, now seen corresponding path program 1 times [2018-10-27 06:09:13,773 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:13,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:13,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:13,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:13,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:13,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:13,785 INFO L82 PathProgramCache]: Analyzing trace with hash 462232030, now seen corresponding path program 1 times [2018-10-27 06:09:13,785 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:13,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:13,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:13,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:13,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:13,986 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-10-27 06:09:14,531 WARN L179 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 140 [2018-10-27 06:09:14,648 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-10-27 06:09:14,651 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:14,651 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:14,651 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:14,651 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:14,651 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:14,652 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:14,652 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:14,652 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:14,652 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration4_Lasso [2018-10-27 06:09:14,652 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:14,652 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:14,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:14,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:14,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:14,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:14,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:14,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:14,999 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2018-10-27 06:09:15,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:15,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:15,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:15,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:15,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:15,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:15,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:15,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:15,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:15,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:15,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:15,777 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-27 06:09:15,910 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:15,910 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:15,910 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-10-27 06:09:15,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:15,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:15,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:15,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:15,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:15,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:15,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:15,916 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:15,916 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-10-27 06:09:15,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:15,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:15,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:15,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:15,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:15,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:15,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:15,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:15,918 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-10-27 06:09:15,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:15,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:15,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:15,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:15,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:15,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:15,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:15,920 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:15,927 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-10-27 06:09:15,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:15,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:15,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:15,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:15,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:15,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:15,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:15,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:15,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:15,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:15,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:15,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:15,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:15,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:15,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:15,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:15,938 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-10-27 06:09:15,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:15,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:15,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:15,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:15,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:15,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:15,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:15,943 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-10-27 06:09:15,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:15,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:15,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:15,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:15,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:15,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:15,952 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:15,952 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-10-27 06:09:15,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:15,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:15,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:15,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:15,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:15,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:15,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:15,966 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-10-27 06:09:15,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:15,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:15,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:15,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:15,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:15,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:15,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:15,979 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-10-27 06:09:15,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:15,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:15,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:15,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:15,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:15,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:15,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:15,990 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-10-27 06:09:15,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:15,992 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:15,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:15,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:15,994 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:15,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:16,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:16,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:16,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:16,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:16,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:16,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:16,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:16,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:16,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:16,011 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-10-27 06:09:16,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:16,011 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:16,012 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-10-27 06:09:16,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:16,053 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-10-27 06:09:16,053 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-10-27 06:09:16,156 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:16,157 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-10-27 06:09:16,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:16,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:16,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:16,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:16,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:16,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:16,165 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:16,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-10-27 06:09:16,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:16,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:16,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:16,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:16,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:16,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:16,188 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:16,201 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:09:16,202 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:09:16,202 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:16,203 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:16,203 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:16,203 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-10-27 06:09:16,481 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:09:16,506 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:09:16,506 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:09:16,506 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:09:16,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:17,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:17,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:17,152 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-10-27 06:09:17,152 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 46 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-10-27 06:09:17,252 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 46 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 93 states and 104 transitions. Complement of second has 11 states. [2018-10-27 06:09:17,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:09:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2018-10-27 06:09:17,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 17 letters. Loop has 7 letters. [2018-10-27 06:09:17,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:17,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 24 letters. Loop has 7 letters. [2018-10-27 06:09:17,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:17,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 17 letters. Loop has 14 letters. [2018-10-27 06:09:17,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:17,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 104 transitions. [2018-10-27 06:09:17,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:17,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 66 states and 74 transitions. [2018-10-27 06:09:17,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-10-27 06:09:17,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-10-27 06:09:17,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 74 transitions. [2018-10-27 06:09:17,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:17,259 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-10-27 06:09:17,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 74 transitions. [2018-10-27 06:09:17,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-10-27 06:09:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-27 06:09:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-10-27 06:09:17,262 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-10-27 06:09:17,262 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-10-27 06:09:17,262 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:09:17,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 63 transitions. [2018-10-27 06:09:17,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:17,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:17,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:17,264 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:17,264 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:17,268 INFO L793 eck$LassoCheckResult]: Stem: 695#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 669#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 670#L14 assume !(build_nondet_String_~length~0 < 1); 679#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 662#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 657#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 658#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 677#L14-3 assume !(build_nondet_String_~length~0 < 1); 678#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 656#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 650#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 651#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 690#L30-5 assume true; 696#L30-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L30-1 703#L30-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 675#L32 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L32 676#L32-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 655#L33-9 assume true; 684#L33-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-1 694#L33-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 667#L33-3 assume !cstrcspn_#t~short7; 661#L33-7 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5; 680#L33-10 SUMMARY for call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-10 681#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 685#L30-4 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 686#L30-5 assume true; 691#L30-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L30-1 687#L30-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 674#L32 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L32 671#L32-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 653#L33-9 [2018-10-27 06:09:17,268 INFO L795 eck$LassoCheckResult]: Loop: 653#L33-9 assume true; 682#L33-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-1 693#L33-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 666#L33-3 assume cstrcspn_#t~short7; 663#L33-4 SUMMARY for call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-4 659#L33-5 cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 652#L33-7 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset + 1;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 653#L33-9 [2018-10-27 06:09:17,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:17,268 INFO L82 PathProgramCache]: Analyzing trace with hash -422203619, now seen corresponding path program 2 times [2018-10-27 06:09:17,268 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:17,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:17,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:17,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:17,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:17,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:17,292 INFO L82 PathProgramCache]: Analyzing trace with hash -168195247, now seen corresponding path program 2 times [2018-10-27 06:09:17,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:17,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:17,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:17,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:17,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:17,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash -271457099, now seen corresponding path program 1 times [2018-10-27 06:09:17,298 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:17,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:17,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:17,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:17,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:17,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:17,420 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9587b1c7-6ff4-457a-a7b2-d5eaccb17730/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:17,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:17,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:17,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-27 06:09:17,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-10-27 06:09:17,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:17,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:17,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:17,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-10-27 06:09:53,993 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-27 06:09:56,502 WARN L179 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 20 [2018-10-27 06:10:21,506 WARN L179 SmtUtils]: Spent 956.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:10:37,326 WARN L179 SmtUtils]: Spent 1.84 s on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:10:37,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 06:10:37,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-10-27 06:10:37,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:37,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:37,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:37,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-10-27 06:10:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:37,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:37,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2018-10-27 06:10:37,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 06:10:37,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=254, Unknown=7, NotChecked=0, Total=306 [2018-10-27 06:10:37,494 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. cyclomatic complexity: 10 Second operand 18 states. [2018-10-27 06:10:38,033 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-10-27 06:10:42,422 WARN L179 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-10-27 06:10:45,393 WARN L179 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-10-27 06:10:48,261 WARN L179 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-10-27 06:10:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:48,264 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2018-10-27 06:10:48,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 06:10:48,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 125 transitions. [2018-10-27 06:10:48,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:10:48,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 92 states and 102 transitions. [2018-10-27 06:10:48,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-10-27 06:10:48,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-10-27 06:10:48,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 102 transitions. [2018-10-27 06:10:48,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:48,268 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-10-27 06:10:48,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 102 transitions. [2018-10-27 06:10:48,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2018-10-27 06:10:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-27 06:10:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-10-27 06:10:48,271 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-10-27 06:10:48,271 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-10-27 06:10:48,271 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:10:48,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 72 transitions. [2018-10-27 06:10:48,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:10:48,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:48,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:48,278 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:48,278 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:48,278 INFO L793 eck$LassoCheckResult]: Stem: 1016#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 993#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 994#L14 assume !(build_nondet_String_~length~0 < 1); 1000#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 985#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 980#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 981#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 998#L14-3 assume !(build_nondet_String_~length~0 < 1); 999#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~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];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 979#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 973#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 974#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 1010#L30-5 assume true; 1017#L30-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L30-1 1025#L30-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 996#L32 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L32 997#L32-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 1024#L33-9 assume true; 1035#L33-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-1 1033#L33-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 989#L33-3 assume cstrcspn_#t~short7; 987#L33-4 SUMMARY for call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-4 983#L33-5 cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 984#L33-7 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5; 1001#L33-10 SUMMARY for call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-10 1002#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 1005#L30-4 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 1006#L30-5 assume true; 1011#L30-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L30-1 1007#L30-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 995#L32 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L32 990#L32-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 976#L33-9 [2018-10-27 06:10:48,278 INFO L795 eck$LassoCheckResult]: Loop: 976#L33-9 assume true; 1003#L33-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-1 1013#L33-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 988#L33-3 assume cstrcspn_#t~short7; 986#L33-4 SUMMARY for call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L33-4 982#L33-5 cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 975#L33-7 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset + 1;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 976#L33-9 [2018-10-27 06:10:48,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:48,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1822686176, now seen corresponding path program 1 times [2018-10-27 06:10:48,278 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:48,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:48,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:48,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:48,319 INFO L82 PathProgramCache]: Analyzing trace with hash -168195247, now seen corresponding path program 3 times [2018-10-27 06:10:48,319 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:48,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:48,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:48,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:48,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1008039506, now seen corresponding path program 1 times [2018-10-27 06:10:48,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:48,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:48,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:49,191 WARN L179 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 183 [2018-10-27 06:10:50,009 WARN L179 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 127 [2018-10-27 06:10:50,011 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:50,011 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:50,011 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:50,011 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:50,011 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:50,011 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:50,011 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:50,012 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:50,012 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-10-27 06:10:50,012 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:50,012 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:50,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,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-10-27 06:10:50,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,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-10-27 06:10:50,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-10-27 06:10:50,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,233 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 06:10:51,014 WARN L179 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 121 [2018-10-27 06:10:51,172 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2018-10-27 06:10:51,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,437 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2018-10-27 06:10:52,142 WARN L179 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-10-27 06:10:52,247 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-27 06:10:52,255 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:52,255 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:52,255 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-10-27 06:10:52,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:52,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:52,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:52,260 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,263 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-10-27 06:10:52,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,273 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,274 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-10-27 06:10:52,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:52,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:52,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:52,275 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,275 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-10-27 06:10:52,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:52,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:52,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:52,276 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:52,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:52,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:52,278 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,278 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-10-27 06:10:52,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:52,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:52,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:52,279 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,280 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-10-27 06:10:52,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:52,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:52,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:52,285 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,285 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-10-27 06:10:52,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:52,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:52,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:52,287 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,287 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-10-27 06:10:52,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,309 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,309 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-10-27 06:10:52,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:52,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:52,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:52,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,311 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-10-27 06:10:52,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:52,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:52,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:52,312 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,313 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-10-27 06:10:52,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:52,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:52,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:52,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,315 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-10-27 06:10:52,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,326 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,327 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-10-27 06:10:52,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,330 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,331 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-10-27 06:10:52,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,331 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:52,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,332 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:52,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,335 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,340 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:52,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,342 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:52,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,354 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,355 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-10-27 06:10:52,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,380 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-10-27 06:10:52,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,382 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-10-27 06:10:52,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,424 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:52,469 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:10:52,469 INFO L444 ModelExtractionUtils]: 54 out of 61 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:10:52,470 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:52,471 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:52,471 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:52,471 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0.base)_1, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0.base)_1 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-10-27 06:10:52,615 INFO L297 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2018-10-27 06:10:52,616 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:10:52,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:52,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:52,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:52,677 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:10:52,677 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 72 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-10-27 06:10:52,764 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 72 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 96 states and 108 transitions. Complement of second has 10 states. [2018-10-27 06:10:52,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2018-10-27 06:10:52,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 33 transitions. Stem has 32 letters. Loop has 7 letters. [2018-10-27 06:10:52,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:52,768 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:52,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:52,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:52,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:52,911 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:10:52,911 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 72 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-10-27 06:10:52,990 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 72 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 96 states and 108 transitions. Complement of second has 10 states. [2018-10-27 06:10:52,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2018-10-27 06:10:52,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 33 transitions. Stem has 32 letters. Loop has 7 letters. [2018-10-27 06:10:52,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:52,991 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:53,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:53,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:53,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:53,062 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:10:53,062 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 72 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-10-27 06:10:53,151 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 72 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 103 states and 118 transitions. Complement of second has 9 states. [2018-10-27 06:10:53,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2018-10-27 06:10:53,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 32 letters. Loop has 7 letters. [2018-10-27 06:10:53,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:53,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 39 letters. Loop has 7 letters. [2018-10-27 06:10:53,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:53,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 32 letters. Loop has 14 letters. [2018-10-27 06:10:53,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:53,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 118 transitions. [2018-10-27 06:10:53,155 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:53,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 0 states and 0 transitions. [2018-10-27 06:10:53,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:10:53,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:10:53,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:10:53,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:53,156 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:53,156 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:53,156 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:53,159 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:10:53,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:10:53,159 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:53,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:10:53,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:10:53 BoogieIcfgContainer [2018-10-27 06:10:53,164 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:10:53,165 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:10:53,165 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:10:53,165 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:10:53,165 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:09" (3/4) ... [2018-10-27 06:10:53,168 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:10:53,168 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:10:53,169 INFO L168 Benchmark]: Toolchain (without parser) took 104317.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 955.7 MB in the beginning and 942.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 213.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:53,169 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:53,170 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.95 ms. Allocated memory is still 1.0 GB. Free memory was 955.7 MB in the beginning and 945.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:53,170 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.10 ms. Allocated memory is still 1.0 GB. Free memory was 945.0 MB in the beginning and 939.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:53,170 INFO L168 Benchmark]: Boogie Preprocessor took 25.78 ms. Allocated memory is still 1.0 GB. Free memory is still 939.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:53,171 INFO L168 Benchmark]: RCFGBuilder took 665.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 939.6 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:53,171 INFO L168 Benchmark]: BuchiAutomizer took 103402.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 942.8 MB in the end (delta: 187.5 MB). Peak memory consumption was 235.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:53,172 INFO L168 Benchmark]: Witness Printer took 3.45 ms. Allocated memory is still 1.2 GB. Free memory is still 942.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:53,177 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 182.95 ms. Allocated memory is still 1.0 GB. Free memory was 955.7 MB in the beginning and 945.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.10 ms. Allocated memory is still 1.0 GB. Free memory was 945.0 MB in the beginning and 939.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.78 ms. Allocated memory is still 1.0 GB. Free memory is still 939.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 665.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 939.6 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 103402.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 942.8 MB in the end (delta: 187.5 MB). Peak memory consumption was 235.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.45 ms. Allocated memory is still 1.2 GB. Free memory is still 942.8 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[build_nondet_String()] + -1 * sc1 and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 8 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString] + -1 * s and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 103.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 90.8s. Construction of modules took 0.4s. Büchi inclusion checks took 11.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 64 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 221 SDtfs, 417 SDslu, 341 SDs, 0 SdLazy, 386 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital365 mio100 ax100 hnf99 lsp90 ukn90 mio100 lsp28 div115 bol100 ite100 ukn100 eq181 hnf82 smp91 dnf725 smp50 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 144ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...