./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d5de307d-fce2-4b96-94d2-ae5dc789b3b9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d5de307d-fce2-4b96-94d2-ae5dc789b3b9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d5de307d-fce2-4b96-94d2-ae5dc789b3b9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d5de307d-fce2-4b96-94d2-ae5dc789b3b9/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d5de307d-fce2-4b96-94d2-ae5dc789b3b9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d5de307d-fce2-4b96-94d2-ae5dc789b3b9/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 0c74f0cc26425c1a044a70e86941b5dd82b132ff ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 04:45:59,953 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:45:59,955 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:45:59,961 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:45:59,961 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:45:59,962 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:45:59,962 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:45:59,964 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:45:59,965 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:45:59,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:45:59,966 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:45:59,966 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:45:59,967 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:45:59,967 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:45:59,968 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:45:59,968 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:45:59,969 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:45:59,970 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:45:59,971 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:45:59,971 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:45:59,972 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:45:59,973 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:45:59,975 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:45:59,975 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:45:59,975 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:45:59,976 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:45:59,976 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:45:59,977 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:45:59,977 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:45:59,978 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:45:59,978 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:45:59,979 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:45:59,979 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:45:59,979 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:45:59,980 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:45:59,980 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:45:59,980 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d5de307d-fce2-4b96-94d2-ae5dc789b3b9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 04:45:59,991 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:45:59,991 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:45:59,992 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 04:45:59,992 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 04:45:59,992 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 04:45:59,992 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 04:45:59,992 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 04:45:59,992 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 04:45:59,993 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 04:45:59,993 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 04:45:59,993 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 04:45:59,993 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:45:59,993 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 04:45:59,993 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:45:59,993 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:45:59,994 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 04:45:59,994 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 04:45:59,994 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 04:45:59,994 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:45:59,994 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 04:45:59,994 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:45:59,994 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 04:45:59,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:45:59,995 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:45:59,995 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 04:45:59,995 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:45:59,995 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 04:45:59,995 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 04:45:59,996 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 04:45:59,996 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_d5de307d-fce2-4b96-94d2-ae5dc789b3b9/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 -> 0c74f0cc26425c1a044a70e86941b5dd82b132ff [2018-11-23 04:46:00,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:46:00,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:46:00,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:46:00,032 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:46:00,032 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:46:00,032 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d5de307d-fce2-4b96-94d2-ae5dc789b3b9/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c [2018-11-23 04:46:00,075 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d5de307d-fce2-4b96-94d2-ae5dc789b3b9/bin-2019/uautomizer/data/178314e7d/9b9c6084884742179d8497a693162c60/FLAGa68db700b [2018-11-23 04:46:00,396 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:46:00,396 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d5de307d-fce2-4b96-94d2-ae5dc789b3b9/sv-benchmarks/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c [2018-11-23 04:46:00,402 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d5de307d-fce2-4b96-94d2-ae5dc789b3b9/bin-2019/uautomizer/data/178314e7d/9b9c6084884742179d8497a693162c60/FLAGa68db700b [2018-11-23 04:46:00,412 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d5de307d-fce2-4b96-94d2-ae5dc789b3b9/bin-2019/uautomizer/data/178314e7d/9b9c6084884742179d8497a693162c60 [2018-11-23 04:46:00,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:46:00,415 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:46:00,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:46:00,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:46:00,418 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:46:00,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:46:00" (1/1) ... [2018-11-23 04:46:00,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d0227ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:46:00, skipping insertion in model container [2018-11-23 04:46:00,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:46:00" (1/1) ... [2018-11-23 04:46:00,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:46:00,440 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:46:00,554 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:46:00,560 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:46:00,572 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:46:00,583 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:46:00,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:46:00 WrapperNode [2018-11-23 04:46:00,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:46:00,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:46:00,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:46:00,584 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:46:00,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:46:00" (1/1) ... [2018-11-23 04:46:00,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:46:00" (1/1) ... [2018-11-23 04:46:00,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:46:00,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:46:00,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:46:00,611 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:46:00,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:46:00" (1/1) ... [2018-11-23 04:46:00,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:46:00" (1/1) ... [2018-11-23 04:46:00,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:46:00" (1/1) ... [2018-11-23 04:46:00,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:46:00" (1/1) ... [2018-11-23 04:46:00,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:46:00" (1/1) ... [2018-11-23 04:46:00,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:46:00" (1/1) ... [2018-11-23 04:46:00,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:46:00" (1/1) ... [2018-11-23 04:46:00,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:46:00,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:46:00,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:46:00,668 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:46:00,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:46:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d5de307d-fce2-4b96-94d2-ae5dc789b3b9/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:46:00,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 04:46:00,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 04:46:00,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:46:00,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:46:00,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 04:46:00,879 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:46:00,880 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 04:46:00,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:46:00 BoogieIcfgContainer [2018-11-23 04:46:00,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:46:00,880 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 04:46:00,880 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 04:46:00,883 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 04:46:00,883 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:46:00,883 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 04:46:00" (1/3) ... [2018-11-23 04:46:00,884 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f9d2bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:46:00, skipping insertion in model container [2018-11-23 04:46:00,884 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:46:00,884 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:46:00" (2/3) ... [2018-11-23 04:46:00,884 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f9d2bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:46:00, skipping insertion in model container [2018-11-23 04:46:00,884 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:46:00,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:46:00" (3/3) ... [2018-11-23 04:46:00,886 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn_true-termination_true-no-overflow.c [2018-11-23 04:46:00,921 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 04:46:00,922 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 04:46:00,922 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 04:46:00,922 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 04:46:00,922 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:46:00,922 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:46:00,922 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 04:46:00,922 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:46:00,922 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 04:46:00,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-23 04:46:00,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 04:46:00,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:46:00,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:46:00,949 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:46:00,949 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 04:46:00,949 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 04:46:00,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-23 04:46:00,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 04:46:00,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:46:00,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:46:00,951 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:46:00,951 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 04:46:00,956 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); 19#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; 16#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;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 4#L31-4true [2018-11-23 04:46:00,956 INFO L796 eck$LassoCheckResult]: Loop: 4#L31-4true call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 11#L31-1true assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 9#L34-5true assume !true; 5#L34-6true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 23#L36true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 6#L31-3true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 4#L31-4true [2018-11-23 04:46:00,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:00,961 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2018-11-23 04:46:00,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:46:00,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:46:00,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:00,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:46:00,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:01,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:01,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2018-11-23 04:46:01,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:46:01,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:46:01,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:01,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:46:01,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:46:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:46:01,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:46:01,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:46:01,094 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:46:01,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 04:46:01,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 04:46:01,105 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 04:46:01,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:46:01,110 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-11-23 04:46:01,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 04:46:01,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-11-23 04:46:01,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 04:46:01,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2018-11-23 04:46:01,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 04:46:01,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 04:46:01,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-11-23 04:46:01,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:46:01,119 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-23 04:46:01,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-11-23 04:46:01,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 04:46:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 04:46:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-23 04:46:01,138 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-23 04:46:01,138 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-23 04:46:01,138 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 04:46:01,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-23 04:46:01,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 04:46:01,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:46:01,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:46:01,139 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:46:01,139 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:46:01,139 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; 60#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; 55#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 50#L31-4 [2018-11-23 04:46:01,140 INFO L796 eck$LassoCheckResult]: Loop: 50#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 51#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 56#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 57#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 61#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6; 52#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 53#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 54#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 50#L31-4 [2018-11-23 04:46:01,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:01,140 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2018-11-23 04:46:01,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:46:01,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:46:01,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:01,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:46:01,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:01,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:01,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2018-11-23 04:46:01,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:46:01,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:46:01,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:01,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:46:01,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:01,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:01,193 INFO L82 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2018-11-23 04:46:01,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:46:01,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:46:01,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:01,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:46:01,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:46:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:46:01,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:46:01,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 04:46:01,523 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-23 04:46:01,667 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-23 04:46:01,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 04:46:01,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:46:01,668 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-23 04:46:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:46:01,814 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 04:46:01,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 04:46:01,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-23 04:46:01,818 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 04:46:01,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 04:46:01,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-23 04:46:01,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-23 04:46:01,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2018-11-23 04:46:01,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:46:01,819 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 04:46:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2018-11-23 04:46:01,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-11-23 04:46:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 04:46:01,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 04:46:01,822 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 04:46:01,822 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 04:46:01,822 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 04:46:01,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-23 04:46:01,823 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 04:46:01,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:46:01,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:46:01,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:46:01,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:46:01,824 INFO L794 eck$LassoCheckResult]: Stem: 134#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; 126#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; 127#L14-3 assume !(build_nondet_String_~length~0 < 1); 129#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; 130#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 142#L31-4 [2018-11-23 04:46:01,824 INFO L796 eck$LassoCheckResult]: Loop: 142#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 141#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 124#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 125#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 138#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6; 139#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 144#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 143#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 142#L31-4 [2018-11-23 04:46:01,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:01,824 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2018-11-23 04:46:01,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:46:01,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:46:01,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:01,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:46:01,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:01,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:01,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2018-11-23 04:46:01,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:46:01,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:46:01,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:01,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:46:01,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:01,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:01,861 INFO L82 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2018-11-23 04:46:01,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:46:01,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:46:01,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:01,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:46:01,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:02,012 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-23 04:46:02,128 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-23 04:46:02,320 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2018-11-23 04:46:02,410 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:46:02,411 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:46:02,411 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:46:02,411 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:46:02,411 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:46:02,412 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:46:02,412 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:46:02,412 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:46:02,412 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_true-termination_true-no-overflow.c_Iteration3_Lasso [2018-11-23 04:46:02,412 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:46:02,412 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:46:02,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:02,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:02,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:02,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:02,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:02,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:02,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:02,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:02,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:02,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:02,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:02,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:02,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:02,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:02,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:02,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:02,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:03,037 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:46:03,040 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 04:46:03,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:03,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:03,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:03,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:03,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:03,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:03,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:03,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:03,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:03,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:03,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:03,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:03,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:03,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:03,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:03,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:03,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:03,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:03,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:03,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:03,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:03,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:03,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:03,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:03,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:03,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:03,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:03,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:03,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:03,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:03,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:03,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:03,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:03,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:03,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:03,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:03,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:03,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:03,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:03,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:03,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:03,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:03,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:03,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:03,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:03,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:03,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:03,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:03,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:03,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:03,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:03,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:03,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:03,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:03,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:03,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:03,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:03,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:03,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:03,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:03,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:03,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:03,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:03,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:03,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:03,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:03,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:03,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:03,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:03,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:03,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:03,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:03,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:03,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:03,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:03,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:03,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:03,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:03,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:03,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:03,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:03,075 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 04:46:03,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:03,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:03,078 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:46:03,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:03,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:03,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:03,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:03,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:03,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:03,088 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:46:03,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:03,089 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:46:03,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:03,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:03,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:03,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:03,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:03,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:03,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:03,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:03,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:03,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:03,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:03,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:03,099 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 04:46:03,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:03,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:03,100 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:46:03,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:03,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:03,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:03,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:03,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:03,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:03,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:03,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:03,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:03,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:03,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:03,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:03,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:03,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:03,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:03,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:03,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:03,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:03,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:03,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:03,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:03,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:03,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:03,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:03,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:03,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:03,133 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 04:46:03,145 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 04:46:03,146 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 04:46:03,148 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 04:46:03,148 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 04:46:03,149 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 04:46:03,149 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1, ULTIMATE.start_cstrspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0.offset Supporting invariants [] [2018-11-23 04:46:03,179 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-23 04:46:03,185 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 04:46:03,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:46:03,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:46:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:46:03,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:46:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:46:03,263 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 04:46:03,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 04:46:03,322 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2018-11-23 04:46:03,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 04:46:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 04:46:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-23 04:46:03,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-23 04:46:03,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:46:03,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-23 04:46:03,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:46:03,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2018-11-23 04:46:03,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:46:03,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2018-11-23 04:46:03,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 04:46:03,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2018-11-23 04:46:03,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 04:46:03,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 04:46:03,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-23 04:46:03,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:46:03,331 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 04:46:03,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-23 04:46:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 04:46:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 04:46:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-23 04:46:03,333 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 04:46:03,333 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 04:46:03,333 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 04:46:03,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-23 04:46:03,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 04:46:03,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:46:03,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:46:03,335 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:46:03,335 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:46:03,335 INFO L794 eck$LassoCheckResult]: Stem: 309#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); 304#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; 297#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 290#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 292#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 298#L34-5 [2018-11-23 04:46:03,335 INFO L796 eck$LassoCheckResult]: Loop: 298#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 299#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 305#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 298#L34-5 [2018-11-23 04:46:03,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:03,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2018-11-23 04:46:03,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:46:03,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:46:03,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:03,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:46:03,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:03,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:03,362 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2018-11-23 04:46:03,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:46:03,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:46:03,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:03,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:46:03,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:03,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:03,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2018-11-23 04:46:03,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:46:03,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:46:03,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:03,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:46:03,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:03,763 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 118 [2018-11-23 04:46:03,838 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:46:03,838 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:46:03,839 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:46:03,839 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:46:03,839 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:46:03,839 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:46:03,839 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:46:03,839 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:46:03,839 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_true-termination_true-no-overflow.c_Iteration4_Lasso [2018-11-23 04:46:03,839 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:46:03,839 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:46:03,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:03,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:03,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:03,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:03,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:03,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:03,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:03,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:03,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:03,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:03,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:03,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:04,002 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2018-11-23 04:46:04,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:04,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:04,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:04,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:04,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:04,469 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-23 04:46:04,473 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:46:04,473 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 04:46:04,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:04,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:04,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:04,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:04,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:04,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:04,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:04,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:04,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:04,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:04,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:04,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:04,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:04,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:04,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:04,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:04,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:04,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:04,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:04,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:04,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:04,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:04,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:04,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:04,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:04,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:04,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:04,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:04,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:04,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:04,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:04,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:04,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:04,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:04,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:04,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:04,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:04,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:04,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:04,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:04,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:04,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:04,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:04,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:04,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:04,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:04,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:04,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:04,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:04,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:04,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:04,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:04,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:04,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:04,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:04,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:04,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:04,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,500 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 04:46:04,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,501 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:46:04,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:04,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:04,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:04,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:04,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:04,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:04,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:04,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:04,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:04,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:04,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:04,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:04,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:04,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:04,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:04,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:04,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:04,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:04,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:04,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:04,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:04,534 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 04:46:04,550 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 04:46:04,550 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 04:46:04,551 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 04:46:04,552 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 04:46:04,552 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 04:46:04,552 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2 Supporting invariants [] [2018-11-23 04:46:04,604 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 04:46:04,606 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 04:46:04,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:46:04,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:46:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:46:04,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:46:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:46:04,675 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 04:46:04,676 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-23 04:46:04,745 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 49 states and 59 transitions. Complement of second has 7 states. [2018-11-23 04:46:04,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 04:46:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 04:46:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-23 04:46:04,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 04:46:04,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:46:04,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-23 04:46:04,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:46:04,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-23 04:46:04,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:46:04,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2018-11-23 04:46:04,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 04:46:04,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 42 transitions. [2018-11-23 04:46:04,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 04:46:04,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 04:46:04,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-11-23 04:46:04,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:46:04,751 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-23 04:46:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-11-23 04:46:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-11-23 04:46:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 04:46:04,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-23 04:46:04,752 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-23 04:46:04,752 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-23 04:46:04,753 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 04:46:04,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-11-23 04:46:04,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 04:46:04,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:46:04,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:46:04,756 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:46:04,756 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:46:04,756 INFO L794 eck$LassoCheckResult]: Stem: 498#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 496#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; 497#L14 assume !(build_nondet_String_~length~0 < 1); 500#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; 490#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; 491#L14-3 assume !(build_nondet_String_~length~0 < 1); 493#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; 485#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 477#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 478#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 492#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 499#L34-1 assume !cstrspn_#t~short7; 495#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6; 482#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 483#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 484#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 479#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 481#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 486#L34-5 [2018-11-23 04:46:04,756 INFO L796 eck$LassoCheckResult]: Loop: 486#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 487#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 494#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 486#L34-5 [2018-11-23 04:46:04,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:04,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2018-11-23 04:46:04,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:46:04,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:46:04,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:04,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:46:04,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:46:04,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:46:04,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:46:04,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 04:46:04,786 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:46:04,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:04,787 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2018-11-23 04:46:04,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:46:04,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:46:04,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:04,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:46:04,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:04,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 04:46:04,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:46:04,888 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-23 04:46:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:46:04,938 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 04:46:04,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 04:46:04,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-11-23 04:46:04,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 04:46:04,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 31 transitions. [2018-11-23 04:46:04,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 04:46:04,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 04:46:04,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-11-23 04:46:04,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:46:04,940 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 04:46:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-11-23 04:46:04,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 04:46:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 04:46:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 04:46:04,942 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 04:46:04,942 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 04:46:04,942 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 04:46:04,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-23 04:46:04,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 04:46:04,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:46:04,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:46:04,943 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:46:04,943 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:46:04,944 INFO L794 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 568#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; 569#L14 assume !(build_nondet_String_~length~0 < 1); 576#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; 565#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; 566#L14-3 assume !(build_nondet_String_~length~0 < 1); 567#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; 560#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 552#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 553#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 572#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 574#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 575#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6; 557#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 558#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 559#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 554#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 556#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 561#L34-5 [2018-11-23 04:46:04,944 INFO L796 eck$LassoCheckResult]: Loop: 561#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 562#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 570#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 561#L34-5 [2018-11-23 04:46:04,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:04,944 INFO L82 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2018-11-23 04:46:04,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:46:04,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:46:04,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:04,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:46:04,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:04,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2018-11-23 04:46:04,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:46:04,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:46:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:04,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:46:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:04,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:04,967 INFO L82 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2018-11-23 04:46:04,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:46:04,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:46:04,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:04,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:46:04,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:46:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:46:05,498 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 153 [2018-11-23 04:46:06,047 WARN L180 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 111 [2018-11-23 04:46:06,049 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:46:06,049 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:46:06,049 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:46:06,049 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:46:06,049 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:46:06,049 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:46:06,049 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:46:06,049 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:46:06,049 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-11-23 04:46:06,049 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:46:06,049 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:46:06,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:46:06,183 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 04:46:06,579 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 98 [2018-11-23 04:46:07,066 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-11-23 04:46:07,280 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:46:07,280 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 04:46:07,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:07,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:07,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:07,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:07,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:07,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:07,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:07,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:07,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:07,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:07,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:07,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:07,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:07,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:07,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:07,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:07,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:07,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:07,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:07,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:07,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:07,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:07,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:07,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:07,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:07,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:07,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:07,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:07,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:07,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:07,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:07,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:07,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:07,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:07,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:07,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:07,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:07,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:07,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:07,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:07,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:07,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:07,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:07,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:46:07,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:46:07,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:46:07,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,307 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-23 04:46:07,307 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-23 04:46:07,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,328 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-11-23 04:46:07,329 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 04:46:07,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:07,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:07,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,410 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 04:46:07,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,411 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:46:07,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:07,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,417 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 04:46:07,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,418 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:46:07,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:07,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:07,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:07,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:07,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:07,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:46:07,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:46:07,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:46:07,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:46:07,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:46:07,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:46:07,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:46:07,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:46:07,445 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 04:46:07,460 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 04:46:07,460 INFO L444 ModelExtractionUtils]: 47 out of 55 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 04:46:07,460 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 04:46:07,461 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 04:46:07,461 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 04:46:07,461 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_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-23 04:46:07,523 INFO L297 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2018-11-23 04:46:07,524 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 04:46:07,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:46:07,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:46:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:46:07,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:46:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:46:07,583 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 04:46:07,583 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-23 04:46:07,624 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 43 states and 48 transitions. Complement of second has 7 states. [2018-11-23 04:46:07,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 04:46:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 04:46:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 04:46:07,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 04:46:07,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:46:07,625 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 04:46:07,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:46:07,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:46:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:46:07,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:46:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:46:07,688 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 04:46:07,688 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-23 04:46:07,730 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 43 states and 48 transitions. Complement of second has 7 states. [2018-11-23 04:46:07,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 04:46:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 04:46:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 04:46:07,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 04:46:07,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:46:07,731 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 04:46:07,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:46:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:46:07,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:46:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:46:07,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:46:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:46:07,785 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 04:46:07,785 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-23 04:46:07,857 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 42 states and 48 transitions. Complement of second has 6 states. [2018-11-23 04:46:07,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 04:46:07,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 04:46:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-23 04:46:07,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 04:46:07,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:46:07,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 21 letters. Loop has 3 letters. [2018-11-23 04:46:07,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:46:07,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-23 04:46:07,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:46:07,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2018-11-23 04:46:07,861 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 04:46:07,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2018-11-23 04:46:07,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 04:46:07,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 04:46:07,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 04:46:07,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:46:07,861 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 04:46:07,861 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 04:46:07,861 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 04:46:07,861 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 04:46:07,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 04:46:07,862 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 04:46:07,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 04:46:07,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 04:46:07 BoogieIcfgContainer [2018-11-23 04:46:07,866 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 04:46:07,866 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:46:07,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:46:07,867 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:46:07,867 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:46:00" (3/4) ... [2018-11-23 04:46:07,869 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 04:46:07,869 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:46:07,870 INFO L168 Benchmark]: Toolchain (without parser) took 7455.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.6 MB). Free memory was 961.1 MB in the beginning and 1.3 GB in the end (delta: -316.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:46:07,870 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:46:07,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.50 ms. Allocated memory is still 1.0 GB. Free memory was 961.1 MB in the beginning and 950.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:46:07,871 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.79 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 945.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:46:07,872 INFO L168 Benchmark]: Boogie Preprocessor took 56.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -198.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-23 04:46:07,872 INFO L168 Benchmark]: RCFGBuilder took 212.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 04:46:07,873 INFO L168 Benchmark]: BuchiAutomizer took 6985.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -148.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:46:07,873 INFO L168 Benchmark]: Witness Printer took 2.75 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:46:07,877 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.50 ms. Allocated memory is still 1.0 GB. Free memory was 961.1 MB in the beginning and 950.4 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 26.79 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 945.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -198.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 212.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6985.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -148.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.75 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[build_nondet_String()] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[malloc(length * sizeof(char))] 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 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 129 SDtfs, 147 SDslu, 143 SDs, 0 SdLazy, 203 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital374 mio100 ax100 hnf99 lsp92 ukn71 mio100 lsp32 div137 bol100 ite100 ukn100 eq168 hnf75 smp92 dnf666 smp23 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 100ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...