./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d3db11fb-1f85-4d42-86a2-762a220c7162/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d3db11fb-1f85-4d42-86a2-762a220c7162/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d3db11fb-1f85-4d42-86a2-762a220c7162/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d3db11fb-1f85-4d42-86a2-762a220c7162/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d3db11fb-1f85-4d42-86a2-762a220c7162/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d3db11fb-1f85-4d42-86a2-762a220c7162/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f39f60c3148e6a8957b92a35d12d506fd8229368 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 09:52:36,602 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:52:36,603 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:52:36,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:52:36,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:52:36,612 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:52:36,612 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:52:36,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:52:36,614 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:52:36,615 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:52:36,616 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:52:36,616 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:52:36,616 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:52:36,617 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:52:36,618 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:52:36,619 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:52:36,619 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:52:36,620 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:52:36,622 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:52:36,623 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:52:36,624 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:52:36,625 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:52:36,626 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:52:36,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:52:36,627 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:52:36,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:52:36,628 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:52:36,628 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:52:36,629 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:52:36,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:52:36,630 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:52:36,630 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:52:36,630 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:52:36,631 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:52:36,631 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:52:36,632 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:52:36,632 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d3db11fb-1f85-4d42-86a2-762a220c7162/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 09:52:36,642 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:52:36,643 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:52:36,643 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:52:36,644 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:52:36,644 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 09:52:36,644 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 09:52:36,644 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 09:52:36,644 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 09:52:36,644 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 09:52:36,645 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 09:52:36,645 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 09:52:36,645 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:52:36,645 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 09:52:36,645 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:52:36,645 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:52:36,645 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 09:52:36,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 09:52:36,645 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 09:52:36,646 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 09:52:36,646 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 09:52:36,646 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 09:52:36,646 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 09:52:36,646 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:52:36,646 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:52:36,646 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 09:52:36,646 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:52:36,647 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 09:52:36,647 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 09:52:36,647 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 09:52:36,647 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_d3db11fb-1f85-4d42-86a2-762a220c7162/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f39f60c3148e6a8957b92a35d12d506fd8229368 [2018-12-09 09:52:36,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:52:36,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:52:36,674 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:52:36,675 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:52:36,675 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:52:36,675 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d3db11fb-1f85-4d42-86a2-762a220c7162/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c [2018-12-09 09:52:36,709 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3db11fb-1f85-4d42-86a2-762a220c7162/bin-2019/uautomizer/data/cf6c3cbaa/4821f37784fb4eca8dce4ad2e9792201/FLAGd925f7b69 [2018-12-09 09:52:37,132 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:52:37,132 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d3db11fb-1f85-4d42-86a2-762a220c7162/sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c [2018-12-09 09:52:37,135 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3db11fb-1f85-4d42-86a2-762a220c7162/bin-2019/uautomizer/data/cf6c3cbaa/4821f37784fb4eca8dce4ad2e9792201/FLAGd925f7b69 [2018-12-09 09:52:37,537 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d3db11fb-1f85-4d42-86a2-762a220c7162/bin-2019/uautomizer/data/cf6c3cbaa/4821f37784fb4eca8dce4ad2e9792201 [2018-12-09 09:52:37,539 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:52:37,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:52:37,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:52:37,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:52:37,544 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:52:37,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:52:37" (1/1) ... [2018-12-09 09:52:37,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed1acf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:52:37, skipping insertion in model container [2018-12-09 09:52:37,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:52:37" (1/1) ... [2018-12-09 09:52:37,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:52:37,563 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:52:37,656 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:52:37,662 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:52:37,672 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:52:37,681 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:52:37,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:52:37 WrapperNode [2018-12-09 09:52:37,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:52:37,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:52:37,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:52:37,682 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:52:37,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:52:37" (1/1) ... [2018-12-09 09:52:37,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:52:37" (1/1) ... [2018-12-09 09:52:37,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:52:37,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:52:37,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:52:37,706 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:52:37,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:52:37" (1/1) ... [2018-12-09 09:52:37,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:52:37" (1/1) ... [2018-12-09 09:52:37,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:52:37" (1/1) ... [2018-12-09 09:52:37,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:52:37" (1/1) ... [2018-12-09 09:52:37,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:52:37" (1/1) ... [2018-12-09 09:52:37,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:52:37" (1/1) ... [2018-12-09 09:52:37,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:52:37" (1/1) ... [2018-12-09 09:52:37,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:52:37,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:52:37,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:52:37,753 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:52:37,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:52:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3db11fb-1f85-4d42-86a2-762a220c7162/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-12-09 09:52:37,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 09:52:37,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:52:37,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:52:37,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:52:37,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 09:52:37,932 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:52:37,932 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-12-09 09:52:37,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:52:37 BoogieIcfgContainer [2018-12-09 09:52:37,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:52:37,933 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 09:52:37,933 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 09:52:37,936 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 09:52:37,937 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 09:52:37,937 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 09:52:37" (1/3) ... [2018-12-09 09:52:37,938 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f18eb2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 09:52:37, skipping insertion in model container [2018-12-09 09:52:37,938 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 09:52:37,938 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:52:37" (2/3) ... [2018-12-09 09:52:37,938 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f18eb2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 09:52:37, skipping insertion in model container [2018-12-09 09:52:37,938 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 09:52:37,938 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:52:37" (3/3) ... [2018-12-09 09:52:37,940 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_true-termination_true-no-overflow.c [2018-12-09 09:52:37,983 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 09:52:37,983 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 09:52:37,983 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 09:52:37,983 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 09:52:37,983 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:52:37,984 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:52:37,984 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 09:52:37,984 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:52:37,984 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 09:52:37,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-12-09 09:52:38,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 09:52:38,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 09:52:38,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 09:52:38,012 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:52:38,012 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 09:52:38,012 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 09:52:38,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-12-09 09:52:38,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 09:52:38,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 09:52:38,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 09:52:38,014 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:52:38,014 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 09:52:38,021 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 22#L14true assume !(build_nondet_String_~length~0 < 1); 18#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 10#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 17#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 12#L14-5true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 8#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 3#L30-4true [2018-12-09 09:52:38,021 INFO L796 eck$LassoCheckResult]: Loop: 3#L30-4true call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 9#L30-1true assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 7#L33-5true assume !true; 4#L33-6true call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 20#L35true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 5#L30-3true cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 3#L30-4true [2018-12-09 09:52:38,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:38,025 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2018-12-09 09:52:38,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:52:38,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:52:38,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:38,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:38,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:38,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:38,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2018-12-09 09:52:38,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:52:38,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:52:38,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:38,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:38,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:52:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:38,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:52:38,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:52:38,135 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 09:52:38,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 09:52:38,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 09:52:38,145 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-12-09 09:52:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:52:38,149 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-12-09 09:52:38,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 09:52:38,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-12-09 09:52:38,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 09:52:38,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2018-12-09 09:52:38,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-09 09:52:38,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-09 09:52:38,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-12-09 09:52:38,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 09:52:38,154 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-09 09:52:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-12-09 09:52:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-09 09:52:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-09 09:52:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-12-09 09:52:38,171 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-09 09:52:38,171 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-09 09:52:38,171 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 09:52:38,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-12-09 09:52:38,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 09:52:38,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 09:52:38,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 09:52:38,172 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:52:38,172 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:52:38,172 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 63#L14 assume !(build_nondet_String_~length~0 < 1); 65#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 58#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 59#L14-3 assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 61#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 57#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 50#L30-4 [2018-12-09 09:52:38,172 INFO L796 eck$LassoCheckResult]: Loop: 50#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 51#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 55#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 56#L33-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 60#L33-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 52#L33-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 53#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 54#L30-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 50#L30-4 [2018-12-09 09:52:38,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:38,172 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2018-12-09 09:52:38,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:52:38,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:52:38,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:38,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:38,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:38,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:38,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2018-12-09 09:52:38,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:52:38,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:52:38,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:38,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:52:38,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:38,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:38,212 INFO L82 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2018-12-09 09:52:38,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:52:38,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:52:38,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:38,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:38,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:52:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:38,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:52:38,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:52:38,575 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-12-09 09:52:38,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:52:38,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:52:38,576 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-12-09 09:52:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:52:38,677 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-09 09:52:38,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:52:38,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-12-09 09:52:38,679 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-09 09:52:38,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2018-12-09 09:52:38,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-12-09 09:52:38,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-12-09 09:52:38,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2018-12-09 09:52:38,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 09:52:38,681 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-09 09:52:38,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2018-12-09 09:52:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-12-09 09:52:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 09:52:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-12-09 09:52:38,683 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-09 09:52:38,684 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-09 09:52:38,684 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 09:52:38,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-12-09 09:52:38,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-12-09 09:52:38,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 09:52:38,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 09:52:38,685 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:52:38,685 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:52:38,685 INFO L794 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 131#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 132#L14 assume !(build_nondet_String_~length~0 < 1); 137#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 127#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 128#L14-3 assume !(build_nondet_String_~length~0 < 1); 136#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 142#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 141#L30-4 [2018-12-09 09:52:38,685 INFO L796 eck$LassoCheckResult]: Loop: 141#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 140#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 123#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 124#L33-1 assume !cstrcspn_#t~short7; 129#L33-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 120#L33-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 121#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 138#L30-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 141#L30-4 [2018-12-09 09:52:38,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:38,686 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2018-12-09 09:52:38,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:52:38,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:52:38,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:38,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:38,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:38,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:38,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1951138125, now seen corresponding path program 1 times [2018-12-09 09:52:38,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:52:38,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:52:38,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:38,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:38,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:38,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:38,718 INFO L82 PathProgramCache]: Analyzing trace with hash -252975234, now seen corresponding path program 1 times [2018-12-09 09:52:38,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:52:38,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:52:38,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:38,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:38,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:39,010 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 104 [2018-12-09 09:52:39,085 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 09:52:39,085 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 09:52:39,085 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 09:52:39,085 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 09:52:39,085 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 09:52:39,086 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 09:52:39,086 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 09:52:39,086 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 09:52:39,086 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration3_Lasso [2018-12-09 09:52:39,086 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 09:52:39,086 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 09:52:39,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:39,619 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 09:52:39,622 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 09:52:39,623 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-12-09 09:52:39,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:39,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:39,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:39,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:39,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:39,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:39,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:39,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:39,627 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-12-09 09:52:39,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:39,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:39,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:39,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:39,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:39,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:39,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:39,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:39,629 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-12-09 09:52:39,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:39,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:39,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:39,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:39,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:39,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:39,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:39,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:39,631 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-12-09 09:52:39,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:39,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:39,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:39,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:39,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:52:39,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:52:39,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:39,635 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-12-09 09:52:39,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:39,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:39,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:39,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:39,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:39,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:39,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:39,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:39,637 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-12-09 09:52:39,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:39,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:39,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:39,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:39,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:52:39,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:52:39,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:39,640 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-12-09 09:52:39,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:39,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:39,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:39,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:39,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:39,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:39,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:39,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:39,641 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-12-09 09:52:39,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:39,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:39,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:39,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:39,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:39,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:39,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:39,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:39,643 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-12-09 09:52:39,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:39,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:39,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:39,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:39,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:39,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:39,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:39,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:39,644 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-12-09 09:52:39,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:39,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:39,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:39,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:39,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:39,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:39,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:39,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:39,645 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-12-09 09:52:39,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:39,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:39,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:39,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:39,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:39,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:39,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:39,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:39,647 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-12-09 09:52:39,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:39,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:39,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:39,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:39,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:39,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:39,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:39,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:39,648 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-12-09 09:52:39,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:39,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:39,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:39,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:39,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:39,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:39,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:39,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:39,650 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-12-09 09:52:39,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:39,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:39,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:39,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:39,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:39,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:39,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:39,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:39,651 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-12-09 09:52:39,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:39,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:39,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:39,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:39,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:52:39,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:52:39,668 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 09:52:39,678 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 09:52:39,678 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 09:52:39,680 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 09:52:39,680 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 09:52:39,681 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 09:52:39,681 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1) = -1*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 Supporting invariants [] [2018-12-09 09:52:39,693 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-12-09 09:52:39,698 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 09:52:39,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:52:39,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:52:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:52:39,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:52:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:39,751 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-12-09 09:52:39,751 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-09 09:52:39,791 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2018-12-09 09:52:39,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 09:52:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 09:52:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-12-09 09:52:39,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2018-12-09 09:52:39,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:52:39,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2018-12-09 09:52:39,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:52:39,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2018-12-09 09:52:39,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:52:39,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2018-12-09 09:52:39,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 09:52:39,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2018-12-09 09:52:39,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-09 09:52:39,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 09:52:39,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-12-09 09:52:39,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 09:52:39,796 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-09 09:52:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-12-09 09:52:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-09 09:52:39,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-09 09:52:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-12-09 09:52:39,798 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-09 09:52:39,798 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-09 09:52:39,798 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 09:52:39,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-12-09 09:52:39,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 09:52:39,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 09:52:39,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 09:52:39,799 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:52:39,799 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 09:52:39,799 INFO L794 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 307#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 308#L14 assume !(build_nondet_String_~length~0 < 1); 311#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 302#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 303#L14-3 assume !(build_nondet_String_~length~0 < 1); 306#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 301#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 290#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 292#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 297#L33-5 [2018-12-09 09:52:39,800 INFO L796 eck$LassoCheckResult]: Loop: 297#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 298#L33-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 304#L33-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 297#L33-5 [2018-12-09 09:52:39,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:39,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2018-12-09 09:52:39,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:52:39,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:52:39,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:39,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:39,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:39,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:39,820 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2018-12-09 09:52:39,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:52:39,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:52:39,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:39,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:39,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:39,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:39,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2018-12-09 09:52:39,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:52:39,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:52:39,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:39,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:39,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:40,165 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 119 [2018-12-09 09:52:40,245 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 09:52:40,245 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 09:52:40,245 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 09:52:40,245 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 09:52:40,246 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 09:52:40,246 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 09:52:40,246 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 09:52:40,246 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 09:52:40,246 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration4_Lasso [2018-12-09 09:52:40,246 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 09:52:40,246 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 09:52:40,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:52:40,820 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-12-09 09:52:40,841 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 09:52:40,841 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 09:52:40,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 09:52:40,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:40,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:40,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:40,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,843 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-12-09 09:52:40,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:40,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:40,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:40,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,845 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-12-09 09:52:40,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:40,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:40,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:40,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 09:52:40,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:52:40,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:52:40,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 09:52:40,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:40,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:40,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:40,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,849 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-12-09 09:52:40,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:40,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:40,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:40,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,850 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-12-09 09:52:40,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:40,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:40,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:40,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,851 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-12-09 09:52:40,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:40,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:40,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:40,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,852 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-12-09 09:52:40,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:40,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:40,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:40,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,854 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-12-09 09:52:40,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:40,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:40,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:40,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,855 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-12-09 09:52:40,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:52:40,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:52:40,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,857 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-12-09 09:52:40,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:40,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:40,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:40,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,858 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-12-09 09:52:40,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:40,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:40,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:40,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,859 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-12-09 09:52:40,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:40,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:40,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:40,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,860 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-12-09 09:52:40,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:40,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:40,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:40,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,862 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-12-09 09:52:40,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:52:40,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:52:40,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:52:40,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,863 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-12-09 09:52:40,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,863 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 09:52:40,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,864 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 09:52:40,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:52:40,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,869 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-12-09 09:52:40,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:52:40,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:52:40,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,872 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-12-09 09:52:40,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:52:40,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:52:40,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,874 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-12-09 09:52:40,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:52:40,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:52:40,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:52:40,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 09:52:40,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:52:40,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:52:40,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:52:40,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:52:40,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:52:40,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:52:40,884 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 09:52:40,892 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 09:52:40,893 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 09:52:40,893 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 09:52:40,893 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 09:52:40,893 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 09:52:40,894 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-12-09 09:52:40,913 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-09 09:52:40,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 09:52:40,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:52:40,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:52:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:52:40,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:52:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:40,979 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-09 09:52:40,979 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-09 09:52:41,028 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 49 states and 59 transitions. Complement of second has 7 states. [2018-12-09 09:52:41,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 09:52:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 09:52:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-09 09:52:41,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-09 09:52:41,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:52:41,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2018-12-09 09:52:41,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:52:41,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-09 09:52:41,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:52:41,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2018-12-09 09:52:41,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 09:52:41,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 42 transitions. [2018-12-09 09:52:41,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 09:52:41,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 09:52:41,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-12-09 09:52:41,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 09:52:41,032 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-09 09:52:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-12-09 09:52:41,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-12-09 09:52:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 09:52:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-12-09 09:52:41,034 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-12-09 09:52:41,034 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-12-09 09:52:41,034 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 09:52:41,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-12-09 09:52:41,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 09:52:41,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 09:52:41,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 09:52:41,035 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:52:41,035 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 09:52:41,035 INFO L794 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 488#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 489#L14 assume !(build_nondet_String_~length~0 < 1); 493#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 483#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 484#L14-3 assume !(build_nondet_String_~length~0 < 1); 487#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 481#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 469#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 470#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 482#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 490#L33-1 assume !cstrcspn_#t~short7; 491#L33-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 475#L33-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 476#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 474#L30-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 471#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 473#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 477#L33-5 [2018-12-09 09:52:41,035 INFO L796 eck$LassoCheckResult]: Loop: 477#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 478#L33-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 485#L33-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 477#L33-5 [2018-12-09 09:52:41,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:41,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 2 times [2018-12-09 09:52:41,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:52:41,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:52:41,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:41,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:41,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:41,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:41,049 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2018-12-09 09:52:41,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:52:41,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:52:41,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:41,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:52:41,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:52:41,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:52:41,054 INFO L82 PathProgramCache]: Analyzing trace with hash -238092697, now seen corresponding path program 1 times [2018-12-09 09:52:41,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:52:41,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:52:41,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:41,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:52:41,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:52:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:52:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:52:41,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:52:41,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3db11fb-1f85-4d42-86a2-762a220c7162/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:52:41,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:52:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:52:41,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:52:41,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 09:52:41,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 09:52:41,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:52:41,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:52:41,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 09:52:41,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-12-09 09:53:18,635 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 09:53:44,011 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-09 09:53:59,645 WARN L180 SmtUtils]: Spent 2.52 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-09 09:53:59,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:53:59,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:53:59,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-12-09 09:53:59,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 09:53:59,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=140, Unknown=7, NotChecked=0, Total=182 [2018-12-09 09:53:59,753 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 14 states. [2018-12-09 09:54:02,639 WARN L180 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2018-12-09 09:54:05,243 WARN L180 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-12-09 09:54:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:54:05,293 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-12-09 09:54:05,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:54:05,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 67 transitions. [2018-12-09 09:54:05,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 09:54:05,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 45 states and 54 transitions. [2018-12-09 09:54:05,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-09 09:54:05,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 09:54:05,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2018-12-09 09:54:05,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 09:54:05,295 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-12-09 09:54:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2018-12-09 09:54:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2018-12-09 09:54:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 09:54:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-12-09 09:54:05,296 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-12-09 09:54:05,296 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-12-09 09:54:05,296 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 09:54:05,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2018-12-09 09:54:05,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 09:54:05,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 09:54:05,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 09:54:05,298 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:54:05,298 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 09:54:05,298 INFO L794 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 666#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 667#L14 assume !(build_nondet_String_~length~0 < 1); 671#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 660#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 661#L14-3 assume !(build_nondet_String_~length~0 < 1); 665#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 658#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 646#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 647#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 675#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 668#L33-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 669#L33-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 651#L33-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 652#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 653#L30-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 648#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 650#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 654#L33-5 [2018-12-09 09:54:05,298 INFO L796 eck$LassoCheckResult]: Loop: 654#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 655#L33-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 662#L33-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 654#L33-5 [2018-12-09 09:54:05,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:54:05,298 INFO L82 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 1 times [2018-12-09 09:54:05,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:54:05,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:54:05,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:54:05,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:54:05,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:54:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:54:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:54:05,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:54:05,311 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2018-12-09 09:54:05,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:54:05,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:54:05,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:54:05,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:54:05,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:54:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:54:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:54:05,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:54:05,316 INFO L82 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2018-12-09 09:54:05,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:54:05,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:54:05,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:54:05,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:54:05,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:54:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:54:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:54:05,821 WARN L180 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 154 [2018-12-09 09:54:06,491 WARN L180 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2018-12-09 09:54:06,493 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 09:54:06,493 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 09:54:06,493 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 09:54:06,493 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 09:54:06,493 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 09:54:06,493 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 09:54:06,493 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 09:54:06,493 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 09:54:06,493 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-12-09 09:54:06,493 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 09:54:06,493 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 09:54:06,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:06,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:06,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:06,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:06,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:06,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:06,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:06,612 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-09 09:54:06,976 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2018-12-09 09:54:07,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:07,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:07,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:07,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:07,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:07,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:07,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:07,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:07,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:07,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 09:54:07,579 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-12-09 09:54:07,718 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 09:54:07,718 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 09:54:07,718 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-12-09 09:54:07,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:54:07,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:54:07,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:54:07,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:54:07,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:54:07,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:54:07,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:54:07,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:54:07,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 09:54:07,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:54:07,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:54:07,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:54:07,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:54:07,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:54:07,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:54:07,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:54:07,722 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-12-09 09:54:07,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:54:07,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:54:07,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:54:07,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:54:07,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:54:07,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:54:07,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:54:07,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:54:07,723 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-12-09 09:54:07,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:54:07,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:54:07,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:54:07,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:54:07,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:54:07,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:54:07,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:54:07,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:54:07,724 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-12-09 09:54:07,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:54:07,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:54:07,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:54:07,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:54:07,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:54:07,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:54:07,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:54:07,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:54:07,725 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-12-09 09:54:07,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:54:07,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 09:54:07,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:54:07,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:54:07,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:54:07,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 09:54:07,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 09:54:07,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:54:07,726 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-12-09 09:54:07,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:54:07,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:54:07,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:54:07,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:54:07,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:54:07,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:54:07,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:54:07,728 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-12-09 09:54:07,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:54:07,728 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 09:54:07,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:54:07,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:54:07,729 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 09:54:07,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:54:07,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:54:07,731 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-12-09 09:54:07,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:54:07,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:54:07,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:54:07,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:54:07,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:54:07,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:54:07,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:54:07,734 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-12-09 09:54:07,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:54:07,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:54:07,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:54:07,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:54:07,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:54:07,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:54:07,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:54:07,737 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-12-09 09:54:07,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:54:07,737 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 09:54:07,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:54:07,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:54:07,739 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 09:54:07,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:54:07,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:54:07,745 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-12-09 09:54:07,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:54:07,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:54:07,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:54:07,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:54:07,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:54:07,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:54:07,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:54:07,748 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-12-09 09:54:07,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:54:07,748 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-12-09 09:54:07,748 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-09 09:54:07,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:54:07,774 INFO L402 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2018-12-09 09:54:07,774 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-12-09 09:54:07,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:54:07,852 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-12-09 09:54:07,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:54:07,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:54:07,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:54:07,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:54:07,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:54:07,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:54:07,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 09:54:07,857 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-12-09 09:54:07,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 09:54:07,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 09:54:07,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 09:54:07,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 09:54:07,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 09:54:07,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 09:54:07,865 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 09:54:07,872 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 09:54:07,872 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 09:54:07,872 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 09:54:07,873 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 09:54:07,873 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 09:54:07,873 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-12-09 09:54:07,926 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-12-09 09:54:07,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 09:54:07,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:54:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:54:07,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:54:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:54:07,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:54:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:54:07,984 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-09 09:54:07,984 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-09 09:54:08,038 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 49 states and 60 transitions. Complement of second has 7 states. [2018-12-09 09:54:08,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 09:54:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 09:54:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-09 09:54:08,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-09 09:54:08,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:54:08,039 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 09:54:08,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:54:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:54:08,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:54:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:54:08,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:54:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:54:08,089 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-09 09:54:08,090 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-09 09:54:08,121 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 49 states and 60 transitions. Complement of second has 7 states. [2018-12-09 09:54:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 09:54:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 09:54:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-09 09:54:08,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-09 09:54:08,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:54:08,122 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 09:54:08,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:54:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:54:08,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:54:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:54:08,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:54:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:54:08,174 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-09 09:54:08,174 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-09 09:54:08,211 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 48 states and 62 transitions. Complement of second has 6 states. [2018-12-09 09:54:08,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 09:54:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 09:54:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-12-09 09:54:08,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-09 09:54:08,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:54:08,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 21 letters. Loop has 3 letters. [2018-12-09 09:54:08,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:54:08,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 6 letters. [2018-12-09 09:54:08,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 09:54:08,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2018-12-09 09:54:08,214 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 09:54:08,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2018-12-09 09:54:08,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 09:54:08,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 09:54:08,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 09:54:08,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 09:54:08,214 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 09:54:08,214 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 09:54:08,214 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 09:54:08,214 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 09:54:08,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 09:54:08,214 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 09:54:08,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 09:54:08,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 09:54:08 BoogieIcfgContainer [2018-12-09 09:54:08,218 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 09:54:08,218 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:54:08,218 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:54:08,219 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:54:08,219 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:52:37" (3/4) ... [2018-12-09 09:54:08,221 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 09:54:08,221 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:54:08,221 INFO L168 Benchmark]: Toolchain (without parser) took 90681.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -79.4 MB). Peak memory consumption was 137.2 MB. Max. memory is 11.5 GB. [2018-12-09 09:54:08,222 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:54:08,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.71 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:54:08,222 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.25 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:54:08,223 INFO L168 Benchmark]: Boogie Preprocessor took 46.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -143.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:54:08,223 INFO L168 Benchmark]: RCFGBuilder took 179.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:54:08,223 INFO L168 Benchmark]: BuchiAutomizer took 90285.49 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 120.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.9 MB). Peak memory consumption was 150.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:54:08,224 INFO L168 Benchmark]: Witness Printer took 2.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:54:08,226 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 140.71 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 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 24.25 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -143.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 179.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 90285.49 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 120.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.9 MB). Peak memory consumption was 150.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[build_nondet_String()] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 90.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 83.9s. Construction of modules took 0.1s. Büchi inclusion checks took 5.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 128 SDtfs, 187 SDslu, 188 SDs, 0 SdLazy, 297 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital338 mio100 ax100 hnf99 lsp91 ukn73 mio100 lsp30 div129 bol100 ite100 ukn100 eq166 hnf80 smp91 dnf844 smp50 tf100 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 104ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 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...