./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i --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_fdaa8066-1056-405c-83ec-67b460140e37/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fdaa8066-1056-405c-83ec-67b460140e37/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fdaa8066-1056-405c-83ec-67b460140e37/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fdaa8066-1056-405c-83ec-67b460140e37/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fdaa8066-1056-405c-83ec-67b460140e37/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fdaa8066-1056-405c-83ec-67b460140e37/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 eaca3e09b762fe94634aa0b3e6a04213782212a5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:54:27,169 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:54:27,171 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:54:27,180 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:54:27,180 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:54:27,181 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:54:27,182 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:54:27,184 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:54:27,185 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:54:27,186 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:54:27,187 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:54:27,187 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:54:27,188 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:54:27,189 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:54:27,190 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:54:27,190 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:54:27,191 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:54:27,193 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:54:27,194 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:54:27,196 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:54:27,197 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:54:27,198 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:54:27,200 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:54:27,200 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:54:27,200 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:54:27,201 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:54:27,202 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:54:27,203 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:54:27,204 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:54:27,205 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:54:27,205 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:54:27,205 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:54:27,206 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:54:27,206 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:54:27,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:54:27,207 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:54:27,208 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fdaa8066-1056-405c-83ec-67b460140e37/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 07:54:27,222 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:54:27,222 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:54:27,223 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:54:27,223 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:54:27,224 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:54:27,224 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 07:54:27,224 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 07:54:27,224 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 07:54:27,224 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 07:54:27,225 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 07:54:27,225 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 07:54:27,225 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:54:27,225 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:54:27,225 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:54:27,225 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:54:27,226 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 07:54:27,226 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 07:54:27,226 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 07:54:27,226 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:54:27,226 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 07:54:27,227 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:54:27,227 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 07:54:27,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:54:27,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:54:27,227 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 07:54:27,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:54:27,228 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:54:27,228 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 07:54:27,229 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 07:54:27,229 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_fdaa8066-1056-405c-83ec-67b460140e37/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 -> eaca3e09b762fe94634aa0b3e6a04213782212a5 [2018-11-23 07:54:27,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:54:27,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:54:27,273 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:54:27,274 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:54:27,274 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:54:27,275 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fdaa8066-1056-405c-83ec-67b460140e37/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i [2018-11-23 07:54:27,329 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fdaa8066-1056-405c-83ec-67b460140e37/bin-2019/uautomizer/data/3442a3bfe/c8b31fb2688e495fbc567fbd92e2735c/FLAGcc32deee2 [2018-11-23 07:54:27,722 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:54:27,723 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fdaa8066-1056-405c-83ec-67b460140e37/sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i [2018-11-23 07:54:27,731 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fdaa8066-1056-405c-83ec-67b460140e37/bin-2019/uautomizer/data/3442a3bfe/c8b31fb2688e495fbc567fbd92e2735c/FLAGcc32deee2 [2018-11-23 07:54:27,742 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fdaa8066-1056-405c-83ec-67b460140e37/bin-2019/uautomizer/data/3442a3bfe/c8b31fb2688e495fbc567fbd92e2735c [2018-11-23 07:54:27,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:54:27,746 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:54:27,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:54:27,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:54:27,750 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:54:27,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:54:27" (1/1) ... [2018-11-23 07:54:27,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25fa39dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:27, skipping insertion in model container [2018-11-23 07:54:27,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:54:27" (1/1) ... [2018-11-23 07:54:27,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:54:27,797 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:54:27,994 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:54:28,001 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:54:28,080 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:54:28,116 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:54:28,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:28 WrapperNode [2018-11-23 07:54:28,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:54:28,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:54:28,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:54:28,117 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:54:28,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:28" (1/1) ... [2018-11-23 07:54:28,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:28" (1/1) ... [2018-11-23 07:54:28,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:54:28,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:54:28,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:54:28,152 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:54:28,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:28" (1/1) ... [2018-11-23 07:54:28,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:28" (1/1) ... [2018-11-23 07:54:28,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:28" (1/1) ... [2018-11-23 07:54:28,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:28" (1/1) ... [2018-11-23 07:54:28,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:28" (1/1) ... [2018-11-23 07:54:28,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:28" (1/1) ... [2018-11-23 07:54:28,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:28" (1/1) ... [2018-11-23 07:54:28,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:54:28,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:54:28,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:54:28,176 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:54:28,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdaa8066-1056-405c-83ec-67b460140e37/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 07:54:28,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 07:54:28,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 07:54:28,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 07:54:28,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 07:54:28,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:54:28,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:54:28,429 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:54:28,429 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 07:54:28,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:54:28 BoogieIcfgContainer [2018-11-23 07:54:28,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:54:28,430 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 07:54:28,430 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 07:54:28,433 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 07:54:28,434 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:54:28,434 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 07:54:27" (1/3) ... [2018-11-23 07:54:28,435 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fd54d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:54:28, skipping insertion in model container [2018-11-23 07:54:28,435 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:54:28,435 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:54:28" (2/3) ... [2018-11-23 07:54:28,436 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fd54d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:54:28, skipping insertion in model container [2018-11-23 07:54:28,436 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:54:28,436 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:54:28" (3/3) ... [2018-11-23 07:54:28,438 INFO L375 chiAutomizerObserver]: Analyzing ICFG strcspn_true-termination.c.i [2018-11-23 07:54:28,482 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:54:28,482 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 07:54:28,482 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 07:54:28,483 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 07:54:28,483 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:54:28,483 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:54:28,483 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 07:54:28,483 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:54:28,483 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 07:54:28,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-23 07:54:28,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 07:54:28,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:54:28,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:54:28,518 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 07:54:28,518 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:54:28,518 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 07:54:28,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-23 07:54:28,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 07:54:28,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:54:28,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:54:28,521 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 07:54:28,521 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:54:28,529 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 12#L519true assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 6#L523true assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 18#L510-4true [2018-11-23 07:54:28,530 INFO L796 eck$LassoCheckResult]: Loop: 18#L510-4true call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 11#L510-1true assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 15#L511-4true assume !true; 19#L511-5true strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 16#L510-3true strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 18#L510-4true [2018-11-23 07:54:28,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:28,536 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-23 07:54:28,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:28,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:28,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:28,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:54:28,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:28,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:28,653 INFO L82 PathProgramCache]: Analyzing trace with hash 44069891, now seen corresponding path program 1 times [2018-11-23 07:54:28,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:28,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:28,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:28,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:54:28,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:54:28,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:54:28,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:54:28,683 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:54:28,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 07:54:28,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 07:54:28,698 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-11-23 07:54:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:54:28,705 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-23 07:54:28,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 07:54:28,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-23 07:54:28,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 07:54:28,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 13 transitions. [2018-11-23 07:54:28,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 07:54:28,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 07:54:28,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2018-11-23 07:54:28,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:54:28,716 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-23 07:54:28,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2018-11-23 07:54:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 07:54:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 07:54:28,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-23 07:54:28,746 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-23 07:54:28,746 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-23 07:54:28,746 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 07:54:28,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2018-11-23 07:54:28,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 07:54:28,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:54:28,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:54:28,747 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 07:54:28,748 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 07:54:28,748 INFO L794 eck$LassoCheckResult]: Stem: 47#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 43#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 50#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 53#L510-4 [2018-11-23 07:54:28,748 INFO L796 eck$LassoCheckResult]: Loop: 53#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 48#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 49#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 44#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 45#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 52#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 53#L510-4 [2018-11-23 07:54:28,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:28,748 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-11-23 07:54:28,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:28,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:28,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:28,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:54:28,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:28,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:28,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1365737035, now seen corresponding path program 1 times [2018-11-23 07:54:28,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:28,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:28,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:28,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:54:28,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:28,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:28,794 INFO L82 PathProgramCache]: Analyzing trace with hash 736220402, now seen corresponding path program 1 times [2018-11-23 07:54:28,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:28,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:28,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:28,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:54:28,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:29,208 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2018-11-23 07:54:29,321 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-23 07:54:29,330 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:54:29,331 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:54:29,331 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:54:29,332 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:54:29,332 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:54:29,332 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:54:29,332 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:54:29,332 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:54:29,332 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration2_Lasso [2018-11-23 07:54:29,333 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:54:29,333 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:54:29,355 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 07:54:29,643 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-11-23 07:54:29,723 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 07:54:29,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 07:54:29,727 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 07:54:29,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 07:54:29,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:54:29,743 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 07:54:29,744 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 07:54:29,746 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 07:54:29,748 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 07:54:29,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:54:29,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:54:29,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:54:29,759 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 07:54:29,760 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 07:54:29,762 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 07:54:29,763 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 07:54:30,084 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:54:30,088 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:54:30,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:30,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:30,092 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:54:30,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:30,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:30,098 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:54:30,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:30,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:30,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:30,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:30,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:30,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:30,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:30,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:30,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:30,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:30,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:30,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:30,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:30,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:30,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:30,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:30,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:30,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:30,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:30,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:30,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:30,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:30,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:30,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:30,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:30,174 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:54:30,196 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 07:54:30,196 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 07:54:30,198 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:54:30,199 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:54:30,200 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:54:30,200 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~s.offset, v_rep(select #length ULTIMATE.start_strcspn_~s.base)_1) = -1*ULTIMATE.start_strcspn_~s.offset + 1*v_rep(select #length ULTIMATE.start_strcspn_~s.base)_1 Supporting invariants [] [2018-11-23 07:54:30,263 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-23 07:54:30,269 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 07:54:30,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:30,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:30,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:30,371 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 07:54:30,375 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 07:54:30,376 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 3 states. [2018-11-23 07:54:30,414 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 20 states and 23 transitions. Complement of second has 4 states. [2018-11-23 07:54:30,415 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 07:54:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:54:30,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-11-23 07:54:30,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-23 07:54:30,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:54:30,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-23 07:54:30,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:54:30,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-23 07:54:30,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:54:30,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-23 07:54:30,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 07:54:30,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 21 transitions. [2018-11-23 07:54:30,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 07:54:30,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 07:54:30,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-23 07:54:30,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:54:30,421 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-23 07:54:30,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-23 07:54:30,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 07:54:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 07:54:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-23 07:54:30,423 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-23 07:54:30,423 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-23 07:54:30,423 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 07:54:30,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-11-23 07:54:30,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 07:54:30,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:54:30,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:54:30,424 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 07:54:30,425 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:54:30,425 INFO L794 eck$LassoCheckResult]: Stem: 191#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 184#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 185#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 196#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 199#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 192#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 193#L511-4 [2018-11-23 07:54:30,425 INFO L796 eck$LassoCheckResult]: Loop: 193#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 186#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 187#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 197#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 193#L511-4 [2018-11-23 07:54:30,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:30,425 INFO L82 PathProgramCache]: Analyzing trace with hash 889571309, now seen corresponding path program 1 times [2018-11-23 07:54:30,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:30,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:30,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:30,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:54:30,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:30,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:30,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 1 times [2018-11-23 07:54:30,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:30,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:30,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:30,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:54:30,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:30,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:30,460 INFO L82 PathProgramCache]: Analyzing trace with hash 736222132, now seen corresponding path program 1 times [2018-11-23 07:54:30,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:30,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:30,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:30,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:54:30,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:30,744 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 95 [2018-11-23 07:54:30,833 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:54:30,833 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:54:30,833 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:54:30,833 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:54:30,833 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:54:30,833 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:54:30,833 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:54:30,833 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:54:30,834 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration3_Lasso [2018-11-23 07:54:30,834 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:54:30,834 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:54:30,840 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 07:54:30,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 07:54:30,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 07:54:30,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 07:54:30,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 07:54:30,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 07:54:30,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 07:54:30,857 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 07:54:30,860 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 07:54:30,862 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 07:54:30,865 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 07:54:31,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 07:54:31,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 07:54:31,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 07:54:31,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 07:54:31,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 07:54:31,068 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 07:54:31,335 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:54:31,335 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:54:31,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:54:31,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:31,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:31,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:31,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:31,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:31,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:31,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:31,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:31,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:31,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:31,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:31,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:31,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:31,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:31,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:31,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:31,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:31,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:31,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:31,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:31,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:31,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:31,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:31,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:31,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:31,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:31,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:31,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:31,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:31,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:31,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:31,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:31,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:31,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:31,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:31,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:31,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:31,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:31,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:31,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:31,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:31,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:31,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:31,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:31,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:31,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:31,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:31,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:31,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:31,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:31,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:31,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:31,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:31,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:31,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:31,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:31,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:31,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:31,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:31,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:31,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:54:31,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:31,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:31,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:31,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:31,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:31,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:31,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:31,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:31,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:54:31,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:31,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:31,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:31,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:31,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:31,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:31,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:31,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:31,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:31,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:31,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:31,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:31,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:31,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:31,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:31,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:31,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:31,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:31,364 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:54:31,364 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 07:54:31,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:31,377 INFO L402 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2018-11-23 07:54:31,378 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-23 07:54:31,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:31,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:31,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:31,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:31,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:31,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:31,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:31,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:31,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:31,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 07:54:31,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:31,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:31,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:31,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:31,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:31,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:31,443 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:54:31,456 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 07:54:31,456 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 07:54:31,456 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:54:31,457 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:54:31,457 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:54:31,458 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_2, ULTIMATE.start_strcspn_~reject.offset, ULTIMATE.start_strcspn_~i~0) = 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_2 - 1*ULTIMATE.start_strcspn_~reject.offset - 1*ULTIMATE.start_strcspn_~i~0 Supporting invariants [] [2018-11-23 07:54:31,523 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-23 07:54:31,524 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 07:54:31,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:31,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:31,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:31,564 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 07:54:31,565 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 07:54:31,565 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 07:54:31,584 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 45 states and 51 transitions. Complement of second has 5 states. [2018-11-23 07:54:31,585 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 07:54:31,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:54:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-23 07:54:31,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 07:54:31,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:54:31,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 07:54:31,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:54:31,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-23 07:54:31,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:54:31,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2018-11-23 07:54:31,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 07:54:31,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 33 transitions. [2018-11-23 07:54:31,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 07:54:31,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 07:54:31,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2018-11-23 07:54:31,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:54:31,589 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 07:54:31,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2018-11-23 07:54:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-23 07:54:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 07:54:31,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 07:54:31,592 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 07:54:31,592 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 07:54:31,592 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 07:54:31,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-11-23 07:54:31,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 07:54:31,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:54:31,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:54:31,593 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:54:31,595 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:54:31,595 INFO L794 eck$LassoCheckResult]: Stem: 368#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 363#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 373#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 379#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 382#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 384#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 383#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 381#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 377#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 378#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 369#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 370#L511-4 [2018-11-23 07:54:31,595 INFO L796 eck$LassoCheckResult]: Loop: 370#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 364#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 365#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 374#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 370#L511-4 [2018-11-23 07:54:31,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1161797001, now seen corresponding path program 2 times [2018-11-23 07:54:31,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:31,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:31,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:31,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:54:31,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:31,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:31,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 2 times [2018-11-23 07:54:31,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:31,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:31,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:31,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:54:31,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:31,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:31,627 INFO L82 PathProgramCache]: Analyzing trace with hash -967302850, now seen corresponding path program 1 times [2018-11-23 07:54:31,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:31,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:31,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:54:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:54:31,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:54:31,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdaa8066-1056-405c-83ec-67b460140e37/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:54:31,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:54:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:31,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:31,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 07:54:31,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 07:54:31,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:54:31,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:54:31,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:54:31,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 07:54:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:54:31,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:54:31,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 07:54:31,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 07:54:31,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-23 07:54:31,918 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 13 states. [2018-11-23 07:54:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:54:31,995 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 07:54:31,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:54:31,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 51 transitions. [2018-11-23 07:54:31,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 07:54:31,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 39 transitions. [2018-11-23 07:54:31,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 07:54:31,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 07:54:31,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2018-11-23 07:54:31,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:54:31,999 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-23 07:54:31,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2018-11-23 07:54:32,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-11-23 07:54:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 07:54:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-23 07:54:32,003 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-23 07:54:32,004 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-23 07:54:32,004 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 07:54:32,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2018-11-23 07:54:32,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 07:54:32,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:54:32,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:54:32,005 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:54:32,005 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:54:32,006 INFO L794 eck$LassoCheckResult]: Stem: 505#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 499#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 500#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 510#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 514#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 518#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 515#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 503#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 504#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 512#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 513#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 520#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 519#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 516#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 517#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 506#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 507#L511-4 [2018-11-23 07:54:32,006 INFO L796 eck$LassoCheckResult]: Loop: 507#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 501#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 502#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 511#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 507#L511-4 [2018-11-23 07:54:32,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:32,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1375356158, now seen corresponding path program 2 times [2018-11-23 07:54:32,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:32,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:32,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:32,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:54:32,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:32,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:32,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 3 times [2018-11-23 07:54:32,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:32,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:32,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:32,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:54:32,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:32,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:32,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1858115515, now seen corresponding path program 3 times [2018-11-23 07:54:32,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:32,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:32,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:32,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:54:32,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:32,573 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 136 [2018-11-23 07:54:32,684 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-11-23 07:54:32,686 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:54:32,686 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:54:32,686 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:54:32,686 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:54:32,686 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:54:32,686 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:54:32,686 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:54:32,686 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:54:32,686 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration5_Lasso [2018-11-23 07:54:32,686 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:54:32,686 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:54:32,690 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 07:54:32,695 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 07:54:32,697 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 07:54:32,699 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 07:54:32,700 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 07:54:32,702 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 07:54:32,705 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 07:54:32,706 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 07:54:32,708 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 07:54:32,711 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 07:54:32,714 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 07:54:32,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 07:54:32,717 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 07:54:32,719 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 07:54:32,721 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 07:54:32,723 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 07:54:32,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 07:54:32,727 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 07:54:33,061 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2018-11-23 07:54:33,140 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 07:54:33,542 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-11-23 07:54:33,653 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:54:33,653 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:54:33,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:33,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:33,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:33,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:33,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:33,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:33,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:33,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:33,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:33,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:33,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:33,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:33,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:33,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:33,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:33,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:33,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:33,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:33,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:33,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:33,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:33,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:33,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:33,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:33,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:33,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:54:33,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:33,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:33,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:33,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:33,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:33,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:33,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:33,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:33,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:33,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:33,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:33,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:33,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:33,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:33,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:33,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:33,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:33,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:33,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:54:33,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:33,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:33,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:33,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:54:33,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:33,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:33,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:33,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:54:33,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:33,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:33,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:33,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:54:33,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:54:33,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:54:33,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:54:33,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:33,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:33,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:33,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:54:33,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:33,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:33,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:54:33,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,704 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:54:33,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,705 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:54:33,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:33,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:33,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,712 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-23 07:54:33,712 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 07:54:33,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,726 INFO L402 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2018-11-23 07:54:33,726 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-23 07:54:33,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:33,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:33,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:33,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:33,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:33,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:33,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:33,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:33,851 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:54:33,894 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 07:54:33,894 INFO L444 ModelExtractionUtils]: 41 out of 49 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 07:54:33,895 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:54:33,895 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:54:33,896 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:54:33,896 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3) = -2*ULTIMATE.start_strcspn_~i~0 + 3*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3 Supporting invariants [] [2018-11-23 07:54:34,036 INFO L297 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2018-11-23 07:54:34,039 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 07:54:34,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:34,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:34,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:34,172 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 07:54:34,173 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-23 07:54:34,173 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-23 07:54:34,230 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 27 states and 30 transitions. Complement of second has 5 states. [2018-11-23 07:54:34,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-23 07:54:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 07:54:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-11-23 07:54:34,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-23 07:54:34,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:54:34,233 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:54:34,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:34,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:34,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:34,355 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 07:54:34,356 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-23 07:54:34,356 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-23 07:54:34,385 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 27 states and 30 transitions. Complement of second has 5 states. [2018-11-23 07:54:34,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-23 07:54:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 07:54:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-11-23 07:54:34,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-23 07:54:34,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:54:34,386 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:54:34,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:34,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:34,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:34,474 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 07:54:34,474 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-23 07:54:34,475 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-23 07:54:34,556 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 56 states and 63 transitions. Complement of second has 11 states. [2018-11-23 07:54:34,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-23 07:54:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 07:54:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2018-11-23 07:54:34,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-23 07:54:34,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:54:34,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-23 07:54:34,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:54:34,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-23 07:54:34,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:54:34,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 63 transitions. [2018-11-23 07:54:34,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 07:54:34,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 42 states and 46 transitions. [2018-11-23 07:54:34,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 07:54:34,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 07:54:34,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2018-11-23 07:54:34,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:54:34,561 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-23 07:54:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2018-11-23 07:54:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-11-23 07:54:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 07:54:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 07:54:34,564 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 07:54:34,564 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 07:54:34,564 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 07:54:34,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2018-11-23 07:54:34,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 07:54:34,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:54:34,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:54:34,566 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-23 07:54:34,566 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:54:34,566 INFO L794 eck$LassoCheckResult]: Stem: 1036#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1030#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 1031#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 1041#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 1047#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1052#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1061#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1058#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1060#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1059#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1057#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1056#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1055#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1045#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1046#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1053#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1066#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1065#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1048#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1049#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1064#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1062#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1050#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1051#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1054#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1037#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1038#L511-4 [2018-11-23 07:54:34,566 INFO L796 eck$LassoCheckResult]: Loop: 1038#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1032#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1033#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1042#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1038#L511-4 [2018-11-23 07:54:34,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:34,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1550213327, now seen corresponding path program 4 times [2018-11-23 07:54:34,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:34,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:34,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:34,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:54:34,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:34,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:34,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 4 times [2018-11-23 07:54:34,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:34,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:34,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:34,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:54:34,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:34,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:34,596 INFO L82 PathProgramCache]: Analyzing trace with hash 229061526, now seen corresponding path program 5 times [2018-11-23 07:54:34,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:54:34,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:54:34,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:34,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:54:34,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:54:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:54:35,281 WARN L180 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 169 [2018-11-23 07:54:35,408 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-23 07:54:35,409 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:54:35,409 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:54:35,409 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:54:35,409 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:54:35,409 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:54:35,409 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:54:35,410 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:54:35,410 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:54:35,410 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration6_Lasso [2018-11-23 07:54:35,410 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:54:35,410 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:54:35,412 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 07:54:35,416 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 07:54:35,771 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-11-23 07:54:35,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 07:54:35,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 07:54:35,854 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 07:54:35,856 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 07:54:35,857 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 07:54:35,859 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 07:54:35,860 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 07:54:35,861 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 07:54:35,862 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 07:54:35,865 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 07:54:35,866 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 07:54:35,868 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 07:54:35,870 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 07:54:35,871 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 07:54:35,872 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 07:54:35,873 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 07:54:35,874 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 07:54:36,065 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 07:54:37,048 WARN L180 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2018-11-23 07:54:37,087 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:54:37,088 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:54:37,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:37,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:37,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:37,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:37,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:37,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:37,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:37,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:37,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:37,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:37,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:37,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:37,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:37,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:37,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:37,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:54:37,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 07:54:37,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:54:37,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:54:37,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:54:37,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:54:37,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:54:37,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:54:37,126 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:54:37,143 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 07:54:37,143 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 07:54:37,143 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:54:37,144 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:54:37,144 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:54:37,144 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4, ULTIMATE.start_strcspn_~i~0, ULTIMATE.start_strcspn_~reject.offset) = 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4 - 1*ULTIMATE.start_strcspn_~i~0 - 1*ULTIMATE.start_strcspn_~reject.offset Supporting invariants [] [2018-11-23 07:54:37,242 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2018-11-23 07:54:37,243 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 07:54:37,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:37,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:37,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:37,286 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 07:54:37,287 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 07:54:37,287 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 07:54:37,302 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 45 states and 50 transitions. Complement of second has 5 states. [2018-11-23 07:54:37,303 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 07:54:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:54:37,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-23 07:54:37,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-23 07:54:37,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:54:37,304 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:54:37,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:37,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:37,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:37,349 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 07:54:37,349 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 07:54:37,349 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 07:54:37,361 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 45 states and 50 transitions. Complement of second has 5 states. [2018-11-23 07:54:37,362 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 07:54:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:54:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-23 07:54:37,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-23 07:54:37,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:54:37,363 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:54:37,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:54:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:37,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:54:37,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:54:37,406 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 07:54:37,406 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 07:54:37,407 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 07:54:37,418 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 62 states and 71 transitions. Complement of second has 4 states. [2018-11-23 07:54:37,419 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 07:54:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:54:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 07:54:37,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-23 07:54:37,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:54:37,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 30 letters. Loop has 4 letters. [2018-11-23 07:54:37,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:54:37,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 26 letters. Loop has 8 letters. [2018-11-23 07:54:37,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:54:37,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 71 transitions. [2018-11-23 07:54:37,423 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 07:54:37,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 0 states and 0 transitions. [2018-11-23 07:54:37,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 07:54:37,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 07:54:37,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 07:54:37,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:54:37,424 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:54:37,424 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:54:37,424 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:54:37,424 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 07:54:37,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 07:54:37,424 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 07:54:37,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 07:54:37,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 07:54:37 BoogieIcfgContainer [2018-11-23 07:54:37,430 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 07:54:37,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:54:37,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:54:37,430 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:54:37,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:54:28" (3/4) ... [2018-11-23 07:54:37,434 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 07:54:37,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:54:37,434 INFO L168 Benchmark]: Toolchain (without parser) took 9689.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 408.4 MB). Free memory was 957.6 MB in the beginning and 1.0 GB in the end (delta: -47.4 MB). Peak memory consumption was 361.0 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:37,435 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:54:37,435 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 957.6 MB in the beginning and 1.2 GB in the end (delta: -198.5 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:37,436 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:37,436 INFO L168 Benchmark]: Boogie Preprocessor took 23.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:37,437 INFO L168 Benchmark]: RCFGBuilder took 253.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:37,437 INFO L168 Benchmark]: BuchiAutomizer took 9000.02 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 123.4 MB). Peak memory consumption was 363.5 MB. Max. memory is 11.5 GB. [2018-11-23 07:54:37,438 INFO L168 Benchmark]: Witness Printer took 3.61 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:54:37,440 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 370.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 957.6 MB in the beginning and 1.2 GB in the end (delta: -198.5 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 253.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9000.02 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 123.4 MB). Peak memory consumption was 363.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.61 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 (2 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[reject] + -1 * reject + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 3 * unknown-#length-unknown[reject] and consists of 8 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[reject] + -1 * i + -1 * reject and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 7.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 115 SDtfs, 193 SDslu, 90 SDs, 0 SdLazy, 125 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital253 mio100 ax100 hnf99 lsp94 ukn78 mio100 lsp37 div100 bol100 ite100 ukn100 eq182 hnf89 smp96 dnf461 smp77 tf100 neg91 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 87ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 12 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 136 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...