./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrpbrk_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_3447775e-feea-4a3c-a49c-932f181269d5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3447775e-feea-4a3c-a49c-932f181269d5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3447775e-feea-4a3c-a49c-932f181269d5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3447775e-feea-4a3c-a49c-932f181269d5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3447775e-feea-4a3c-a49c-932f181269d5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3447775e-feea-4a3c-a49c-932f181269d5/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 eec7850a55859668859d25c9503478e74955da1a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:06:41,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:06:41,234 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:06:41,245 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:06:41,245 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:06:41,246 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:06:41,247 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:06:41,248 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:06:41,249 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:06:41,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:06:41,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:06:41,256 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:06:41,256 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:06:41,257 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:06:41,258 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:06:41,259 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:06:41,259 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:06:41,261 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:06:41,273 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:06:41,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:06:41,276 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:06:41,277 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:06:41,283 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:06:41,284 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:06:41,284 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:06:41,285 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:06:41,286 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:06:41,287 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:06:41,288 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:06:41,289 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:06:41,289 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:06:41,289 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:06:41,289 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:06:41,290 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:06:41,296 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:06:41,298 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:06:41,298 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3447775e-feea-4a3c-a49c-932f181269d5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:06:41,323 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:06:41,326 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:06:41,327 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:06:41,327 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:06:41,327 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:06:41,327 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:06:41,327 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:06:41,327 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:06:41,328 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:06:41,328 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:06:41,328 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:06:41,328 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:06:41,328 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:06:41,328 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:06:41,328 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:06:41,329 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:06:41,329 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:06:41,329 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:06:41,329 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:06:41,329 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:06:41,329 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:06:41,329 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:06:41,330 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:06:41,330 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:06:41,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:06:41,330 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:06:41,333 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:06:41,334 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:06:41,334 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_3447775e-feea-4a3c-a49c-932f181269d5/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 -> eec7850a55859668859d25c9503478e74955da1a [2018-10-27 06:06:41,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:06:41,372 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:06:41,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:06:41,376 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:06:41,376 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:06:41,377 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3447775e-feea-4a3c-a49c-932f181269d5/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c [2018-10-27 06:06:41,418 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3447775e-feea-4a3c-a49c-932f181269d5/bin-2019/uautomizer/data/36185ec90/6c86b5454ded4c65ae6a6cfc69f8b90a/FLAGab5f387bd [2018-10-27 06:06:41,787 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:06:41,788 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3447775e-feea-4a3c-a49c-932f181269d5/sv-benchmarks/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c [2018-10-27 06:06:41,792 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3447775e-feea-4a3c-a49c-932f181269d5/bin-2019/uautomizer/data/36185ec90/6c86b5454ded4c65ae6a6cfc69f8b90a/FLAGab5f387bd [2018-10-27 06:06:41,804 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3447775e-feea-4a3c-a49c-932f181269d5/bin-2019/uautomizer/data/36185ec90/6c86b5454ded4c65ae6a6cfc69f8b90a [2018-10-27 06:06:41,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:06:41,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:06:41,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:41,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:06:41,812 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:06:41,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:41" (1/1) ... [2018-10-27 06:06:41,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1277d5ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:41, skipping insertion in model container [2018-10-27 06:06:41,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:41" (1/1) ... [2018-10-27 06:06:41,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:06:41,837 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:06:41,955 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:41,962 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:06:41,973 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:41,984 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:06:41,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:41 WrapperNode [2018-10-27 06:06:41,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:41,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:41,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:06:41,985 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:06:41,992 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:06:41" (1/1) ... [2018-10-27 06:06:42,000 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:06:41" (1/1) ... [2018-10-27 06:06:42,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:42,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:06:42,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:06:42,019 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:06:42,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:41" (1/1) ... [2018-10-27 06:06:42,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:41" (1/1) ... [2018-10-27 06:06:42,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:41" (1/1) ... [2018-10-27 06:06:42,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:41" (1/1) ... [2018-10-27 06:06:42,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:41" (1/1) ... [2018-10-27 06:06:42,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:41" (1/1) ... [2018-10-27 06:06:42,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:41" (1/1) ... [2018-10-27 06:06:42,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:06:42,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:06:42,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:06:42,042 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:06:42,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3447775e-feea-4a3c-a49c-932f181269d5/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:06:42,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:06:42,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:06:42,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:06:42,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:06:42,611 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:06:42,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:42 BoogieIcfgContainer [2018-10-27 06:06:42,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:06:42,612 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:06:42,612 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:06:42,616 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:06:42,617 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:42,617 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:06:41" (1/3) ... [2018-10-27 06:06:42,618 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@86bb979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:42, skipping insertion in model container [2018-10-27 06:06:42,618 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:42,618 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:41" (2/3) ... [2018-10-27 06:06:42,618 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@86bb979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:42, skipping insertion in model container [2018-10-27 06:06:42,619 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:42,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:42" (3/3) ... [2018-10-27 06:06:42,620 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_true-termination_true-no-overflow.c [2018-10-27 06:06:42,673 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:06:42,674 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:06:42,674 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:06:42,674 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:06:42,674 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:06:42,675 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:06:42,675 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:06:42,675 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:06:42,675 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:06:42,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-10-27 06:06:42,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:06:42,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:42,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:42,724 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:42,725 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:42,725 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:06:42,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-10-27 06:06:42,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:06:42,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:42,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:42,730 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:42,731 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:42,743 INFO L793 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#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.base, main_#t~ret12.offset;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; 19#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; 8#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; 14#L14-3true assume !(build_nondet_String_~length~0 < 1); 28#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_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 4#L31-5true [2018-10-27 06:06:42,743 INFO L795 eck$LassoCheckResult]: Loop: 4#L31-5true assume true; 10#L31-1true SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L31-1 9#L31-2true assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 31#L33true SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L33 30#L33-1true cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 34#L34-9true assume !true; 33#L34-10true SUMMARY for call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-10 21#L36true assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 6#L31-4true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 4#L31-5true [2018-10-27 06:06:42,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:42,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1755105166, now seen corresponding path program 1 times [2018-10-27 06:06:42,754 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:42,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:42,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:42,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:42,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:42,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:42,914 INFO L82 PathProgramCache]: Analyzing trace with hash 883669989, now seen corresponding path program 1 times [2018-10-27 06:06:42,914 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:42,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:42,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:42,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:42,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:42,944 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:06:42,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:42,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:06:42,949 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:06:42,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:06:42,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:06:42,962 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-10-27 06:06:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:42,968 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-10-27 06:06:42,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:06:42,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2018-10-27 06:06:42,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:06:42,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 31 transitions. [2018-10-27 06:06:42,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-10-27 06:06:42,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-10-27 06:06:42,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-10-27 06:06:42,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:42,979 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-10-27 06:06:42,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-10-27 06:06:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-27 06:06:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-27 06:06:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-10-27 06:06:42,998 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-10-27 06:06:42,998 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-10-27 06:06:42,999 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:06:42,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-10-27 06:06:43,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:06:43,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:43,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:43,000 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:43,000 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:43,001 INFO L793 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 86#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.base, main_#t~ret12.offset;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; 87#L14 assume !(build_nondet_String_~length~0 < 1); 92#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; 80#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; 89#L14-3 assume !(build_nondet_String_~length~0 < 1); 90#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; 76#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_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 74#L31-5 [2018-10-27 06:06:43,001 INFO L795 eck$LassoCheckResult]: Loop: 74#L31-5 assume true; 75#L31-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L31-1 81#L31-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 82#L33 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L33 98#L33-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 95#L34-9 assume true; 91#L34-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-1 88#L34-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 83#L34-3 assume !cstrpbrk_#t~short7; 84#L34-7 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 94#L34-10 SUMMARY for call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-10 93#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 77#L31-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 74#L31-5 [2018-10-27 06:06:43,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:43,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1755105166, now seen corresponding path program 2 times [2018-10-27 06:06:43,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:43,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:43,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:43,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:43,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:43,036 INFO L82 PathProgramCache]: Analyzing trace with hash 311113554, now seen corresponding path program 1 times [2018-10-27 06:06:43,036 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:43,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:43,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:43,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:43,332 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:06:43,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:43,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 06:06:43,333 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:06:43,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:06:43,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:06:43,334 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-10-27 06:06:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:43,972 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-10-27 06:06:43,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 06:06:43,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 39 transitions. [2018-10-27 06:06:43,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:06:43,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 37 transitions. [2018-10-27 06:06:43,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-10-27 06:06:43,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-10-27 06:06:43,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2018-10-27 06:06:43,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:43,977 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-10-27 06:06:43,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2018-10-27 06:06:43,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-10-27 06:06:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-27 06:06:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-10-27 06:06:43,980 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-10-27 06:06:43,981 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-10-27 06:06:43,981 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:06:43,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2018-10-27 06:06:43,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:06:43,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:43,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:43,982 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:43,982 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:43,983 INFO L793 eck$LassoCheckResult]: Stem: 191#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 179#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.base, main_#t~ret12.offset;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; 180#L14 assume !(build_nondet_String_~length~0 < 1); 185#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; 173#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 171#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 172#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; 182#L14-3 assume !(build_nondet_String_~length~0 < 1); 183#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; 169#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 165#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 166#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_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 167#L31-5 [2018-10-27 06:06:43,983 INFO L795 eck$LassoCheckResult]: Loop: 167#L31-5 assume true; 168#L31-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L31-1 174#L31-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 175#L33 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L33 190#L33-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 187#L34-9 assume true; 184#L34-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-1 181#L34-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 176#L34-3 assume cstrpbrk_#t~short7; 178#L34-4 SUMMARY for call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-4 188#L34-5 cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 189#L34-7 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 192#L34-10 SUMMARY for call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-10 186#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 170#L31-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 167#L31-5 [2018-10-27 06:06:43,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:43,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1755105166, now seen corresponding path program 3 times [2018-10-27 06:06:43,983 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:43,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:43,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:43,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:44,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:44,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1134451409, now seen corresponding path program 1 times [2018-10-27 06:06:44,013 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:44,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:44,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:44,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:44,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:44,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:44,034 INFO L82 PathProgramCache]: Analyzing trace with hash 689254914, now seen corresponding path program 1 times [2018-10-27 06:06:44,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:44,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:44,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:44,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:44,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:44,437 WARN L179 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-10-27 06:06:44,619 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-27 06:06:45,024 WARN L179 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2018-10-27 06:06:45,174 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-10-27 06:06:45,191 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:45,192 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:45,192 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:45,192 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:45,193 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:45,193 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:45,193 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:45,193 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:45,193 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration3_Lasso [2018-10-27 06:06:45,193 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:45,194 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:45,212 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:06:45,232 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:06:45,234 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:06:45,235 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:06:45,274 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:06:45,276 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:06:45,279 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:06:45,306 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:06:45,311 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:06:45,314 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:06:45,317 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:06:45,319 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:06:45,321 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:06:45,323 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:06:45,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,326 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:06:45,328 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:06:45,359 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:06:45,669 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2018-10-27 06:06:45,794 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2018-10-27 06:06:45,794 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:06:46,338 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:46,342 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:46,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:46,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,352 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:06:46,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,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:06:46,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,357 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,357 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:06:46,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,359 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:06:46,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,361 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,361 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:06:46,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:46,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:46,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,369 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,370 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:06:46,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,372 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,372 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:06:46,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,374 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:46,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:46,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,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:06:46,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,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:06:46,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,384 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,384 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:06:46,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:46,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,388 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:46,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,390 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:46,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,393 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:06:46,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,395 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:06:46,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:46,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,400 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:06:46,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:46,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,407 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:06:46,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,407 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:46,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,410 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:46,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,426 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,426 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:06:46,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:46,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,456 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:06:46,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,459 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,459 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:06:46,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:46,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,533 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:46,579 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:06:46,579 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:06:46,584 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:46,585 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:46,586 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:46,586 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 Supporting invariants [] [2018-10-27 06:06:46,658 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-10-27 06:06:46,663 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:06:46,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:46,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:46,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:46,787 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:06:46,790 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:06:46,791 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 32 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-10-27 06:06:46,916 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 32 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 44 states and 51 transitions. Complement of second has 6 states. [2018-10-27 06:06:46,916 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:06:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:06:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-10-27 06:06:46,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 12 letters. Loop has 15 letters. [2018-10-27 06:06:46,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:46,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 27 letters. Loop has 15 letters. [2018-10-27 06:06:46,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:46,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 12 letters. Loop has 30 letters. [2018-10-27 06:06:46,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:46,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 51 transitions. [2018-10-27 06:06:46,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:06:46,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 41 states and 48 transitions. [2018-10-27 06:06:46,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-10-27 06:06:46,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-10-27 06:06:46,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 48 transitions. [2018-10-27 06:06:46,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:46,924 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-10-27 06:06:46,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 48 transitions. [2018-10-27 06:06:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-10-27 06:06:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-27 06:06:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-10-27 06:06:46,928 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-10-27 06:06:46,928 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-10-27 06:06:46,928 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:06:46,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 47 transitions. [2018-10-27 06:06:46,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:06:46,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:46,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:46,930 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:06:46,930 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:46,930 INFO L793 eck$LassoCheckResult]: Stem: 412#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 389#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.base, main_#t~ret12.offset;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; 390#L14 assume !(build_nondet_String_~length~0 < 1); 403#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; 384#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 382#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 383#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; 399#L14-3 assume !(build_nondet_String_~length~0 < 1); 400#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; 380#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 374#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 375#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_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 376#L31-5 assume true; 378#L31-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L31-1 385#L31-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 386#L33 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L33 410#L33-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 405#L34-9 [2018-10-27 06:06:46,930 INFO L795 eck$LassoCheckResult]: Loop: 405#L34-9 assume true; 401#L34-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-1 397#L34-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 391#L34-3 assume !cstrpbrk_#t~short7; 392#L34-7 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset + 1;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 405#L34-9 [2018-10-27 06:06:46,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:46,931 INFO L82 PathProgramCache]: Analyzing trace with hash 556795412, now seen corresponding path program 1 times [2018-10-27 06:06:46,931 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:46,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:46,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:46,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:46,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:46,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:46,961 INFO L82 PathProgramCache]: Analyzing trace with hash 66864142, now seen corresponding path program 1 times [2018-10-27 06:06:46,962 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:46,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:46,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:46,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:46,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:46,991 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:06:46,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:46,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:06:46,992 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:06:46,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:06:46,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:06:46,992 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-10-27 06:06:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:47,007 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-10-27 06:06:47,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:06:47,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 46 transitions. [2018-10-27 06:06:47,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:06:47,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 44 transitions. [2018-10-27 06:06:47,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-10-27 06:06:47,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-10-27 06:06:47,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 44 transitions. [2018-10-27 06:06:47,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:47,011 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-10-27 06:06:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 44 transitions. [2018-10-27 06:06:47,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-27 06:06:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-27 06:06:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-10-27 06:06:47,013 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-10-27 06:06:47,013 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-10-27 06:06:47,013 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:06:47,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2018-10-27 06:06:47,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:06:47,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:47,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:47,015 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:06:47,015 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:47,015 INFO L793 eck$LassoCheckResult]: Stem: 497#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 480#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.base, main_#t~ret12.offset;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; 481#L14 assume !(build_nondet_String_~length~0 < 1); 488#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; 471#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 469#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 470#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; 484#L14-3 assume !(build_nondet_String_~length~0 < 1); 485#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; 467#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 461#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 462#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_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 463#L31-5 assume true; 465#L31-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L31-1 472#L31-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 473#L33 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L33 498#L33-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 491#L34-9 [2018-10-27 06:06:47,015 INFO L795 eck$LassoCheckResult]: Loop: 491#L34-9 assume true; 486#L34-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-1 482#L34-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 476#L34-3 assume cstrpbrk_#t~short7; 477#L34-4 SUMMARY for call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-4 495#L34-5 cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 490#L34-7 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset + 1;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 491#L34-9 [2018-10-27 06:06:47,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:47,015 INFO L82 PathProgramCache]: Analyzing trace with hash 556795412, now seen corresponding path program 2 times [2018-10-27 06:06:47,015 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:47,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:47,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:47,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:47,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:47,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:47,054 INFO L82 PathProgramCache]: Analyzing trace with hash -168195247, now seen corresponding path program 1 times [2018-10-27 06:06:47,054 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:47,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:47,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:47,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:47,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:47,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash 462232030, now seen corresponding path program 1 times [2018-10-27 06:06:47,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:47,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:47,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:47,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:47,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:47,310 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-10-27 06:06:47,803 WARN L179 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 140 [2018-10-27 06:06:47,905 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:47,905 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:47,905 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:47,905 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:47,905 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:47,905 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:47,905 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:47,906 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:47,906 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration5_Lasso [2018-10-27 06:06:47,906 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:47,906 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:47,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:06:47,915 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:06:47,917 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:06:47,918 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:06:47,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:06:47,922 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:06:47,924 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:06:47,925 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:06:47,927 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:06:47,928 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:06:47,929 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:06:47,931 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:06:47,932 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:06:47,934 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:06:47,935 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:06:48,256 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2018-10-27 06:06:48,372 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-10-27 06:06:48,373 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:06:48,376 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:06:48,377 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:06:48,379 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:06:48,626 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-10-27 06:06:48,880 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-27 06:06:48,970 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:48,970 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:48,971 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:06:48,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:48,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:48,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:48,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:48,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:48,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:48,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:48,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:48,973 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:06:48,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:48,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:48,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:48,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:48,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:48,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:48,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:48,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:48,981 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:06:48,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:48,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:48,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:48,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:48,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:48,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:48,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:48,982 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:48,983 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:06:48,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:48,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:48,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:48,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:48,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:48,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:48,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:48,984 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:48,984 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:06:48,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:48,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:48,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:48,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:48,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:48,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:48,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:48,986 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:48,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:48,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:48,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:48,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:48,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:48,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:48,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:49,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:49,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:49,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:49,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:49,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,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:06:49,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:49,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:49,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:49,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:49,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:49,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:49,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:49,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,014 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:06:49,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:49,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:49,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:49,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,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:06:49,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:49,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:49,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:49,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,018 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:06:49,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:49,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:49,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,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:06:49,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:49,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:49,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:49,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,035 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:06:49,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:49,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:49,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:49,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,037 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:06:49,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:49,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:49,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:49,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:49,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:49,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:49,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:49,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:49,064 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,064 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:06:49,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,065 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:49,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,067 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:49,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:49,082 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,083 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:06:49,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,083 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:49,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,085 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:49,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:49,093 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,093 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:06:49,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:49,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:49,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,099 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:06:49,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:49,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:49,108 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:49,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:49,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:49,115 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:49,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,119 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:49,119 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-10-27 06:06:49,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,137 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-10-27 06:06:49,137 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-10-27 06:06:49,222 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,223 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:06:49,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:49,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:49,225 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,225 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:06:49,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:49,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:49,253 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:49,268 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:06:49,268 INFO L444 ModelExtractionUtils]: 57 out of 61 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:06:49,268 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:49,269 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:49,269 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:49,269 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 Supporting invariants [] [2018-10-27 06:06:49,489 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:06:49,491 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:06:49,491 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:06:49,491 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:06:49,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:49,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:49,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:49,770 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:06:49,771 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:06:49,771 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 44 transitions. cyclomatic complexity: 7 Second operand 8 states. [2018-10-27 06:06:49,875 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 44 transitions. cyclomatic complexity: 7. Second operand 8 states. Result 90 states and 98 transitions. Complement of second has 11 states. [2018-10-27 06:06:49,876 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:06:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:06:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-10-27 06:06:49,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 17 letters. Loop has 7 letters. [2018-10-27 06:06:49,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:49,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 24 letters. Loop has 7 letters. [2018-10-27 06:06:49,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:49,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 17 letters. Loop has 14 letters. [2018-10-27 06:06:49,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:49,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 98 transitions. [2018-10-27 06:06:49,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:06:49,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 64 states and 70 transitions. [2018-10-27 06:06:49,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-10-27 06:06:49,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-10-27 06:06:49,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 70 transitions. [2018-10-27 06:06:49,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:49,880 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-10-27 06:06:49,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 70 transitions. [2018-10-27 06:06:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-10-27 06:06:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-27 06:06:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-10-27 06:06:49,883 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-10-27 06:06:49,883 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-10-27 06:06:49,883 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:06:49,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 61 transitions. [2018-10-27 06:06:49,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:06:49,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:49,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:49,884 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:06:49,884 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:49,885 INFO L793 eck$LassoCheckResult]: Stem: 789#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 770#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.base, main_#t~ret12.offset;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; 771#L14 assume !(build_nondet_String_~length~0 < 1); 778#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; 760#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 758#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 759#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; 774#L14-3 assume !(build_nondet_String_~length~0 < 1); 775#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; 756#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 749#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 750#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_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 751#L31-5 assume true; 752#L31-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L31-1 763#L31-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 764#L33 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L33 787#L33-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 788#L34-9 assume true; 777#L34-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-1 773#L34-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 768#L34-3 assume cstrpbrk_#t~short7; 769#L34-4 SUMMARY for call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-4 785#L34-5 cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 782#L34-7 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 783#L34-10 SUMMARY for call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-10 779#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 757#L31-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 753#L31-5 assume true; 755#L31-1 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L31-1 761#L31-2 assume !!(cstrpbrk_#t~mem3 != 0);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 762#L33 SUMMARY for call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L33 786#L33-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 781#L34-9 [2018-10-27 06:06:49,885 INFO L795 eck$LassoCheckResult]: Loop: 781#L34-9 assume true; 776#L34-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-1 772#L34-2 cstrpbrk_#t~short7 := cstrpbrk_#t~mem5 != 0; 766#L34-3 assume cstrpbrk_#t~short7; 767#L34-4 SUMMARY for call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L34-4 784#L34-5 cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 780#L34-7 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset + 1;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 781#L34-9 [2018-10-27 06:06:49,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:49,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1822686176, now seen corresponding path program 2 times [2018-10-27 06:06:49,885 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:49,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:49,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:49,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:49,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:49,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:49,908 INFO L82 PathProgramCache]: Analyzing trace with hash -168195247, now seen corresponding path program 2 times [2018-10-27 06:06:49,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:49,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:49,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:49,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:49,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:49,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:49,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1008039506, now seen corresponding path program 1 times [2018-10-27 06:06:49,913 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:49,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:49,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:49,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:49,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:50,540 WARN L179 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-10-27 06:06:51,248 WARN L179 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 176 [2018-10-27 06:06:51,975 WARN L179 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 120 [2018-10-27 06:06:51,977 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:51,977 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:51,977 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:51,977 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:51,977 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:51,977 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:51,977 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:51,977 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:51,977 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-10-27 06:06:51,978 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:51,978 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:51,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,011 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:06:52,013 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:06:52,015 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:06:52,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,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:06:52,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,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:06:52,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:06:52,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:06:52,026 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:06:52,153 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 06:06:52,836 WARN L179 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 116 [2018-10-27 06:06:52,948 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2018-10-27 06:06:52,949 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:06:52,954 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:06:52,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:06:52,958 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:06:52,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:06:52,960 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:06:52,962 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:06:52,963 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:06:53,146 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-10-27 06:06:53,544 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-10-27 06:06:53,648 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-27 06:06:53,818 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:53,818 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:53,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:53,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,821 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:06:53,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,822 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,823 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:06:53,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,824 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,824 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:06:53,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:53,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,827 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:53,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,829 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,829 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:06:53,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:53,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,831 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,831 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:06:53,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,833 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,833 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:06:53,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,835 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,835 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:06:53,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,838 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,838 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:06:53,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,838 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-10-27 06:06:53,838 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-10-27 06:06:53,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,857 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-10-27 06:06:53,858 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-10-27 06:06:53,961 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,962 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:06:53,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,964 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:06:53,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,968 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:06:53,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,969 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:53,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,970 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:53,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,977 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,977 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:06:53,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,992 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:54,019 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:06:54,019 INFO L444 ModelExtractionUtils]: 45 out of 52 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:06:54,019 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:54,020 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:54,020 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:54,020 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2018-10-27 06:06:54,282 INFO L297 tatePredicateManager]: 21 out of 23 supporting invariants were superfluous and have been removed [2018-10-27 06:06:54,285 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:06:54,285 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:06:54,285 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:06:54,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:54,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:54,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:54,388 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:06:54,388 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:06:54,388 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-10-27 06:06:54,473 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 84 states and 90 transitions. Complement of second has 11 states. [2018-10-27 06:06:54,474 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:06:54,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:06:54,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-10-27 06:06:54,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 32 letters. Loop has 7 letters. [2018-10-27 06:06:54,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:54,475 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:06:54,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:54,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:54,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:54,612 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:06:54,613 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2018-10-27 06:06:54,613 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-10-27 06:06:54,698 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 84 states and 90 transitions. Complement of second has 11 states. [2018-10-27 06:06:54,698 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:06:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:06:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-10-27 06:06:54,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 32 letters. Loop has 7 letters. [2018-10-27 06:06:54,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:54,699 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:06:54,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:54,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:54,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:54,780 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:06:54,781 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-10-27 06:06:54,781 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-10-27 06:06:54,900 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 89 states and 96 transitions. Complement of second has 10 states. [2018-10-27 06:06:54,902 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:06:54,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:06:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2018-10-27 06:06:54,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 47 transitions. Stem has 32 letters. Loop has 7 letters. [2018-10-27 06:06:54,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:54,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 47 transitions. Stem has 39 letters. Loop has 7 letters. [2018-10-27 06:06:54,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:54,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 47 transitions. Stem has 32 letters. Loop has 14 letters. [2018-10-27 06:06:54,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:54,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 96 transitions. [2018-10-27 06:06:54,905 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:54,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 0 states and 0 transitions. [2018-10-27 06:06:54,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:06:54,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:06:54,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:06:54,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:54,905 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:54,906 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:54,906 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:54,906 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:06:54,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:06:54,906 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:54,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:06:54,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:06:54 BoogieIcfgContainer [2018-10-27 06:06:54,917 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:06:54,917 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:06:54,917 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:06:54,917 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:06:54,918 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:42" (3/4) ... [2018-10-27 06:06:54,920 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:06:54,921 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:06:54,921 INFO L168 Benchmark]: Toolchain (without parser) took 13113.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 275.3 MB). Free memory was 955.8 MB in the beginning and 877.4 MB in the end (delta: 78.4 MB). Peak memory consumption was 353.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:54,922 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:54,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.02 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 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:06:54,923 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.98 ms. Allocated memory is still 1.0 GB. Free memory was 945.0 MB in the beginning and 942.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:54,923 INFO L168 Benchmark]: Boogie Preprocessor took 22.52 ms. Allocated memory is still 1.0 GB. Free memory is still 942.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:54,923 INFO L168 Benchmark]: RCFGBuilder took 570.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:54,924 INFO L168 Benchmark]: BuchiAutomizer took 12304.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.8 MB). Free memory was 1.1 GB in the beginning and 877.4 MB in the end (delta: 240.5 MB). Peak memory consumption was 377.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:54,924 INFO L168 Benchmark]: Witness Printer took 3.51 ms. Allocated memory is still 1.3 GB. Free memory is still 877.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:54,928 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.02 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 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.98 ms. Allocated memory is still 1.0 GB. Free memory was 945.0 MB in the beginning and 942.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.52 ms. Allocated memory is still 1.0 GB. Free memory is still 942.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 570.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12304.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.8 MB). Free memory was 1.1 GB in the beginning and 877.4 MB in the end (delta: 240.5 MB). Peak memory consumption was 377.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.51 ms. Allocated memory is still 1.3 GB. Free memory is still 877.4 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 - 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * 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 -1 * sc1 + unknown-#length-unknown[build_nondet_String()] and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 8 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 8 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 10.1s. Construction of modules took 0.5s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 203 SDtfs, 280 SDslu, 245 SDs, 0 SdLazy, 278 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital384 mio100 ax100 hnf99 lsp91 ukn83 mio100 lsp30 div124 bol100 ite100 ukn100 eq170 hnf82 smp90 dnf632 smp25 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 123ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...