./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fb64ff0c-c732-43f7-9638-5c9ff9ed3b5a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fb64ff0c-c732-43f7-9638-5c9ff9ed3b5a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fb64ff0c-c732-43f7-9638-5c9ff9ed3b5a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fb64ff0c-c732-43f7-9638-5c9ff9ed3b5a/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_fb64ff0c-c732-43f7-9638-5c9ff9ed3b5a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fb64ff0c-c732-43f7-9638-5c9ff9ed3b5a/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-1dbac8b [2018-11-10 02:35:21,210 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:35:21,211 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:35:21,218 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:35:21,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:35:21,219 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:35:21,220 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:35:21,221 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:35:21,222 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:35:21,223 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:35:21,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:35:21,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:35:21,224 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:35:21,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:35:21,226 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:35:21,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:35:21,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:35:21,228 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:35:21,229 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:35:21,230 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:35:21,231 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:35:21,232 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:35:21,233 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:35:21,233 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:35:21,233 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:35:21,234 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:35:21,235 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:35:21,235 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:35:21,236 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:35:21,237 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:35:21,237 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:35:21,237 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:35:21,237 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:35:21,238 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:35:21,238 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:35:21,239 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:35:21,239 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fb64ff0c-c732-43f7-9638-5c9ff9ed3b5a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 02:35:21,250 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:35:21,250 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:35:21,251 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 02:35:21,251 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 02:35:21,251 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 02:35:21,251 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 02:35:21,251 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 02:35:21,252 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 02:35:21,252 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 02:35:21,252 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 02:35:21,252 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 02:35:21,252 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:35:21,252 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 02:35:21,252 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:35:21,252 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:35:21,253 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 02:35:21,253 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 02:35:21,253 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 02:35:21,253 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:35:21,253 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 02:35:21,253 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 02:35:21,253 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:35:21,253 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:35:21,254 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 02:35:21,254 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:35:21,254 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 02:35:21,254 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 02:35:21,255 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 02:35:21,255 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_fb64ff0c-c732-43f7-9638-5c9ff9ed3b5a/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-10 02:35:21,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:35:21,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:35:21,292 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:35:21,293 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:35:21,293 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:35:21,294 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fb64ff0c-c732-43f7-9638-5c9ff9ed3b5a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i [2018-11-10 02:35:21,340 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fb64ff0c-c732-43f7-9638-5c9ff9ed3b5a/bin-2019/uautomizer/data/a34c65edd/172d704f7c7d4f88bb790a61319d43bd/FLAG85826d526 [2018-11-10 02:35:21,718 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:35:21,719 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fb64ff0c-c732-43f7-9638-5c9ff9ed3b5a/sv-benchmarks/c/termination-libowfat/strcspn_true-termination.c.i [2018-11-10 02:35:21,725 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fb64ff0c-c732-43f7-9638-5c9ff9ed3b5a/bin-2019/uautomizer/data/a34c65edd/172d704f7c7d4f88bb790a61319d43bd/FLAG85826d526 [2018-11-10 02:35:21,735 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fb64ff0c-c732-43f7-9638-5c9ff9ed3b5a/bin-2019/uautomizer/data/a34c65edd/172d704f7c7d4f88bb790a61319d43bd [2018-11-10 02:35:21,738 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:35:21,739 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:35:21,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:35:21,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:35:21,743 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:35:21,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:35:21" (1/1) ... [2018-11-10 02:35:21,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55799e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:21, skipping insertion in model container [2018-11-10 02:35:21,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:35:21" (1/1) ... [2018-11-10 02:35:21,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:35:21,780 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:35:21,971 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:35:21,976 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:35:22,000 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:35:22,028 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:35:22,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:22 WrapperNode [2018-11-10 02:35:22,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:35:22,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:35:22,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:35:22,029 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:35:22,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:22" (1/1) ... [2018-11-10 02:35:22,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:22" (1/1) ... [2018-11-10 02:35:22,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:35:22,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:35:22,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:35:22,099 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:35:22,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:22" (1/1) ... [2018-11-10 02:35:22,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:22" (1/1) ... [2018-11-10 02:35:22,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:22" (1/1) ... [2018-11-10 02:35:22,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:22" (1/1) ... [2018-11-10 02:35:22,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:22" (1/1) ... [2018-11-10 02:35:22,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:22" (1/1) ... [2018-11-10 02:35:22,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:22" (1/1) ... [2018-11-10 02:35:22,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:35:22,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:35:22,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:35:22,118 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:35:22,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb64ff0c-c732-43f7-9638-5c9ff9ed3b5a/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-10 02:35:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 02:35:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 02:35:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:35:22,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:35:22,304 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:35:22,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:35:22 BoogieIcfgContainer [2018-11-10 02:35:22,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:35:22,305 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 02:35:22,305 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 02:35:22,307 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 02:35:22,308 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:35:22,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 02:35:21" (1/3) ... [2018-11-10 02:35:22,308 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c9b393e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:35:22, skipping insertion in model container [2018-11-10 02:35:22,308 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:35:22,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:22" (2/3) ... [2018-11-10 02:35:22,309 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c9b393e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:35:22, skipping insertion in model container [2018-11-10 02:35:22,309 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:35:22,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:35:22" (3/3) ... [2018-11-10 02:35:22,310 INFO L375 chiAutomizerObserver]: Analyzing ICFG strcspn_true-termination.c.i [2018-11-10 02:35:22,351 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 02:35:22,352 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 02:35:22,352 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 02:35:22,352 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 02:35:22,352 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:35:22,352 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:35:22,352 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 02:35:22,352 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:35:22,352 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 02:35:22,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 02:35:22,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 02:35:22,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:35:22,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:35:22,381 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:22,381 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 02:35:22,381 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 02:35:22,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 02:35:22,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 02:35:22,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:35:22,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:35:22,382 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:22,382 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 02:35:22,389 INFO L793 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; 8#L521true SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L521 10#L521-1true main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 20#L523true assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 18#L525true SUMMARY for call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L525 19#L525-1true assume { :begin_inline_strcspn } true;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; 3#L510-5true [2018-11-10 02:35:22,389 INFO L795 eck$LassoCheckResult]: Loop: 3#L510-5true assume true; 11#L510-1true SUMMARY for call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L510-1 14#L510-2true assume !!(strcspn_#t~mem8 != 0);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 27#L511-5true assume !true; 17#L511-6true strcspn_#t~pre7 := strcspn_~l~0 + 1;strcspn_~l~0 := strcspn_~l~0 + 1;havoc strcspn_#t~pre7; 16#L510-4true strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, strcspn_~s.offset + 1;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, strcspn_~s.offset + 1;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 3#L510-5true [2018-11-10 02:35:22,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:22,394 INFO L82 PathProgramCache]: Analyzing trace with hash 175627178, now seen corresponding path program 1 times [2018-11-10 02:35:22,395 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:22,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:22,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:22,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:22,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:22,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:22,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1480301945, now seen corresponding path program 1 times [2018-11-10 02:35:22,494 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:22,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:22,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:22,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:22,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:22,513 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-10 02:35:22,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:35:22,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 02:35:22,517 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:35:22,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 02:35:22,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 02:35:22,527 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-10 02:35:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:35:22,532 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-10 02:35:22,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 02:35:22,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2018-11-10 02:35:22,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 02:35:22,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 21 transitions. [2018-11-10 02:35:22,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 02:35:22,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 02:35:22,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2018-11-10 02:35:22,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:35:22,538 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-10 02:35:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2018-11-10 02:35:22,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-10 02:35:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 02:35:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-10 02:35:22,555 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-10 02:35:22,555 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-10 02:35:22,555 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 02:35:22,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 21 transitions. [2018-11-10 02:35:22,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 02:35:22,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:35:22,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:35:22,556 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:22,557 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:22,557 INFO L793 eck$LassoCheckResult]: Stem: 75#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 68#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 69#L519 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; 70#L521 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L521 71#L521-1 main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 64#L523 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 62#L525 SUMMARY for call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L525 63#L525-1 assume { :begin_inline_strcspn } true;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; 58#L510-5 [2018-11-10 02:35:22,557 INFO L795 eck$LassoCheckResult]: Loop: 58#L510-5 assume true; 59#L510-1 SUMMARY for call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L510-1 76#L510-2 assume !!(strcspn_#t~mem8 != 0);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 77#L511-5 assume true; 72#L511-1 SUMMARY for call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L511-1 73#L511-2 assume !(strcspn_#t~mem6 != 0);havoc strcspn_#t~mem6; 60#L511-6 strcspn_#t~pre7 := strcspn_~l~0 + 1;strcspn_~l~0 := strcspn_~l~0 + 1;havoc strcspn_#t~pre7; 61#L510-4 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, strcspn_~s.offset + 1;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, strcspn_~s.offset + 1;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 58#L510-5 [2018-11-10 02:35:22,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:22,557 INFO L82 PathProgramCache]: Analyzing trace with hash 175627178, now seen corresponding path program 2 times [2018-11-10 02:35:22,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:22,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:22,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:22,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:22,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:22,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:22,587 INFO L82 PathProgramCache]: Analyzing trace with hash 919743307, now seen corresponding path program 1 times [2018-11-10 02:35:22,587 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:22,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:22,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:22,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:35:22,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:22,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:22,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1181502964, now seen corresponding path program 1 times [2018-11-10 02:35:22,600 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:22,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:22,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:22,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:22,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:23,006 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2018-11-10 02:35:23,091 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:35:23,092 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:35:23,092 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:35:23,092 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:35:23,092 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:35:23,093 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:35:23,093 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:35:23,093 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:35:23,093 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration2_Lasso [2018-11-10 02:35:23,093 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:35:23,093 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:35:23,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:23,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:23,119 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-10 02:35:23,121 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-10 02:35:23,123 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-10 02:35:23,126 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-10 02:35:23,127 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-10 02:35:23,129 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-10 02:35:23,131 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-10 02:35:23,134 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-10 02:35:23,137 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-10 02:35:23,143 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-10 02:35:23,427 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2018-11-10 02:35:23,547 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-11-10 02:35:23,547 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-10 02:35:23,548 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-10 02:35:23,549 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-10 02:35:23,551 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-10 02:35:23,551 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-10 02:35:23,902 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:35:23,906 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:35:23,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:23,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:23,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:23,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:23,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:23,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:23,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:23,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:23,912 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:23,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:23,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:23,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:23,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:23,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:23,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:23,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:23,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:23,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:23,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:23,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:23,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:23,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:23,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:23,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:23,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:23,920 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:23,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:23,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:23,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:23,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:23,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:23,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:23,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:23,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:23,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:23,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:23,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:23,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:23,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:23,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:23,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:23,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:23,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:23,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:23,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:23,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:23,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:23,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:23,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:23,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:23,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:23,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:23,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:23,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:23,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:23,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:23,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:23,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:23,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:23,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:23,931 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:23,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:23,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:23,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:23,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:23,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:23,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:23,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:23,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:23,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:23,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:23,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:23,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:23,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:23,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:23,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:23,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:23,947 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:23,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:23,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:23,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:23,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:23,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:23,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:23,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:23,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:23,951 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:23,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:23,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:23,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:23,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:23,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:23,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:23,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:23,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:23,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:23,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:23,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:23,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:23,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:23,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:23,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:23,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:23,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:23,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:23,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:23,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:23,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:23,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:23,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:23,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:23,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:23,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:23,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:23,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:23,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:23,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:23,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:23,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:23,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:23,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:23,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:23,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:23,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:23,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:23,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:23,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:23,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:23,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:23,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:23,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:23,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:23,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:23,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:23,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:24,026 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:35:24,045 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 02:35:24,046 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 02:35:24,047 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:35:24,049 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:35:24,049 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:35:24,050 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~s.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1) = -1*ULTIMATE.start_strcspn_~s.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 Supporting invariants [] [2018-11-10 02:35:24,092 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-10 02:35:24,099 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 02:35:24,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:24,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:24,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:24,201 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-10 02:35:24,203 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 02:35:24,204 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 21 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-11-10 02:35:24,243 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 21 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 32 states and 35 transitions. Complement of second has 7 states. [2018-11-10 02:35:24,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:35:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 02:35:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-10 02:35:24,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-10 02:35:24,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:24,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-10 02:35:24,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:24,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 16 letters. [2018-11-10 02:35:24,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:24,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2018-11-10 02:35:24,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:35:24,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 33 transitions. [2018-11-10 02:35:24,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 02:35:24,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 02:35:24,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2018-11-10 02:35:24,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:35:24,249 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-10 02:35:24,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2018-11-10 02:35:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-10 02:35:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 02:35:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-10 02:35:24,252 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-10 02:35:24,252 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-10 02:35:24,252 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 02:35:24,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 33 transitions. [2018-11-10 02:35:24,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:35:24,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:35:24,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:35:24,253 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:24,253 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:24,253 INFO L793 eck$LassoCheckResult]: Stem: 274#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 264#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 265#L519 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; 266#L521 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L521 267#L521-1 main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 257#L523 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 255#L525 SUMMARY for call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L525 256#L525-1 assume { :begin_inline_strcspn } true;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; 249#L510-5 assume true; 251#L510-1 SUMMARY for call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L510-1 275#L510-2 assume !!(strcspn_#t~mem8 != 0);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 277#L511-5 [2018-11-10 02:35:24,253 INFO L795 eck$LassoCheckResult]: Loop: 277#L511-5 assume true; 268#L511-1 SUMMARY for call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L511-1 269#L511-2 assume !!(strcspn_#t~mem6 != 0);havoc strcspn_#t~mem6; 258#L512 SUMMARY for call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L512 259#L512-1 SUMMARY for call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L512-1 262#L512-2 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 272#L511-4 strcspn_#t~pre3 := strcspn_~i~0 + 1;strcspn_~i~0 := strcspn_~i~0 + 1;havoc strcspn_#t~pre3; 277#L511-5 [2018-11-10 02:35:24,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:24,253 INFO L82 PathProgramCache]: Analyzing trace with hash 839113167, now seen corresponding path program 1 times [2018-11-10 02:35:24,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:24,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:24,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:24,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:24,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:24,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:24,273 INFO L82 PathProgramCache]: Analyzing trace with hash -774959707, now seen corresponding path program 1 times [2018-11-10 02:35:24,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:24,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:24,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:24,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:24,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:24,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:24,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1554460695, now seen corresponding path program 1 times [2018-11-10 02:35:24,282 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:24,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:24,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:24,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:24,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:24,572 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 115 [2018-11-10 02:35:24,646 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:35:24,646 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:35:24,646 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:35:24,646 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:35:24,646 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:35:24,646 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:35:24,646 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:35:24,647 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:35:24,647 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration3_Lasso [2018-11-10 02:35:24,647 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:35:24,647 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:35:24,650 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-10 02:35:24,652 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-10 02:35:24,653 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-10 02:35:24,654 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-10 02:35:24,655 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-10 02:35:24,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:24,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:24,658 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-10 02:35:24,659 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-10 02:35:24,660 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-10 02:35:24,661 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-10 02:35:24,863 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2018-11-10 02:35:24,893 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-10 02:35:24,894 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-10 02:35:24,895 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-10 02:35:24,896 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-10 02:35:24,898 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-10 02:35:24,899 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-10 02:35:25,227 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:35:25,227 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:35:25,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:25,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:25,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:25,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:25,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:25,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:25,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:25,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:25,230 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:25,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:25,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:25,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:25,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:25,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:25,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:25,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:25,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:25,231 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:25,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:25,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:25,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:25,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:25,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:25,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:25,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:25,234 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:25,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:25,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:25,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:25,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:25,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:25,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:25,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:25,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:25,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:25,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:25,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:25,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:25,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:25,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:25,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:25,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:25,243 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:25,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:25,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:25,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:25,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:25,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:25,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:25,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:25,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:25,244 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:25,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:25,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:25,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:25,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:25,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:25,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:25,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:25,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:25,246 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:25,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:25,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:25,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:25,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:25,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:25,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:25,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:25,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:25,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:25,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:25,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:25,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:25,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:25,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:25,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:25,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:25,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:25,250 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:25,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:25,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:25,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:25,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:25,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:25,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:25,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:25,254 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:25,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:25,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:25,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:25,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:25,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:25,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:25,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:25,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:25,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:25,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:25,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:25,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:25,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:25,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:25,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:25,261 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:25,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:25,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:25,262 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:35:25,262 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-10 02:35:25,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:25,270 INFO L402 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2018-11-10 02:35:25,270 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-10 02:35:25,316 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:25,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:25,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:25,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:25,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:25,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:25,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:25,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:25,321 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:25,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:25,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:25,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:25,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:25,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:25,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:25,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:25,350 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:35:25,380 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 02:35:25,380 INFO L444 ModelExtractionUtils]: 48 out of 58 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 02:35:25,380 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:35:25,381 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:35:25,381 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:35:25,381 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_2, ULTIMATE.start_strcspn_~reject.offset) = -1*ULTIMATE.start_strcspn_~i~0 + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_2 - 1*ULTIMATE.start_strcspn_~reject.offset Supporting invariants [] [2018-11-10 02:35:25,424 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-10 02:35:25,426 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 02:35:25,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:25,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:25,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:25,486 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-10 02:35:25,486 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-10 02:35:25,486 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 33 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-10 02:35:25,507 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 33 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 75 states and 81 transitions. Complement of second has 7 states. [2018-11-10 02:35:25,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:35:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:35:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 02:35:25,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 7 letters. [2018-11-10 02:35:25,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:25,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 18 letters. Loop has 7 letters. [2018-11-10 02:35:25,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:25,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 14 letters. [2018-11-10 02:35:25,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:25,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 81 transitions. [2018-11-10 02:35:25,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:35:25,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 48 states and 52 transitions. [2018-11-10 02:35:25,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 02:35:25,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 02:35:25,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 52 transitions. [2018-11-10 02:35:25,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:35:25,512 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-10 02:35:25,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 52 transitions. [2018-11-10 02:35:25,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-11-10 02:35:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 02:35:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-11-10 02:35:25,515 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-10 02:35:25,515 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-10 02:35:25,515 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 02:35:25,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 44 transitions. [2018-11-10 02:35:25,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:35:25,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:35:25,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:35:25,516 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:25,516 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:25,517 INFO L793 eck$LassoCheckResult]: Stem: 522#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 512#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 513#L519 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; 514#L521 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L521 515#L521-1 main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 505#L523 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 503#L525 SUMMARY for call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L525 504#L525-1 assume { :begin_inline_strcspn } true;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; 496#L510-5 assume true; 497#L510-1 SUMMARY for call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L510-1 526#L510-2 assume !!(strcspn_#t~mem8 != 0);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 527#L511-5 assume true; 520#L511-1 SUMMARY for call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L511-1 521#L511-2 assume !(strcspn_#t~mem6 != 0);havoc strcspn_#t~mem6; 501#L511-6 strcspn_#t~pre7 := strcspn_~l~0 + 1;strcspn_~l~0 := strcspn_~l~0 + 1;havoc strcspn_#t~pre7; 502#L510-4 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, strcspn_~s.offset + 1;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, strcspn_~s.offset + 1;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 498#L510-5 assume true; 500#L510-1 SUMMARY for call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L510-1 523#L510-2 assume !!(strcspn_#t~mem8 != 0);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 525#L511-5 [2018-11-10 02:35:25,517 INFO L795 eck$LassoCheckResult]: Loop: 525#L511-5 assume true; 518#L511-1 SUMMARY for call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L511-1 519#L511-2 assume !!(strcspn_#t~mem6 != 0);havoc strcspn_#t~mem6; 506#L512 SUMMARY for call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L512 507#L512-1 SUMMARY for call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L512-1 510#L512-2 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 516#L511-4 strcspn_#t~pre3 := strcspn_~i~0 + 1;strcspn_~i~0 := strcspn_~i~0 + 1;havoc strcspn_#t~pre3; 525#L511-5 [2018-11-10 02:35:25,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:25,517 INFO L82 PathProgramCache]: Analyzing trace with hash 897829701, now seen corresponding path program 2 times [2018-11-10 02:35:25,517 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:25,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:25,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:25,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:25,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:25,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:25,536 INFO L82 PathProgramCache]: Analyzing trace with hash -774959707, now seen corresponding path program 2 times [2018-11-10 02:35:25,536 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:25,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:25,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:25,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:35:25,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:25,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:25,541 INFO L82 PathProgramCache]: Analyzing trace with hash 424725985, now seen corresponding path program 1 times [2018-11-10 02:35:25,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:25,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:25,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:25,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:35:25,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:35:25,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:35:25,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 02:35:25,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 02:35:25,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:35:25,726 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. cyclomatic complexity: 6 Second operand 9 states. [2018-11-10 02:35:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:35:25,791 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-11-10 02:35:25,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:35:25,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 82 transitions. [2018-11-10 02:35:25,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:35:25,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 62 states and 65 transitions. [2018-11-10 02:35:25,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 02:35:25,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-10 02:35:25,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 65 transitions. [2018-11-10 02:35:25,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:35:25,795 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-11-10 02:35:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 65 transitions. [2018-11-10 02:35:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 45. [2018-11-10 02:35:25,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 02:35:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-10 02:35:25,800 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-10 02:35:25,800 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-10 02:35:25,800 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 02:35:25,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 48 transitions. [2018-11-10 02:35:25,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:35:25,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:35:25,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:35:25,801 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:25,801 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:25,802 INFO L793 eck$LassoCheckResult]: Stem: 664#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 654#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 655#L519 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; 656#L521 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L521 657#L521-1 main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 647#L523 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 645#L525 SUMMARY for call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L525 646#L525-1 assume { :begin_inline_strcspn } true;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; 638#L510-5 assume true; 639#L510-1 SUMMARY for call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L510-1 682#L510-2 assume !!(strcspn_#t~mem8 != 0);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 670#L511-5 assume true; 660#L511-1 SUMMARY for call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L511-1 661#L511-2 assume !!(strcspn_#t~mem6 != 0);havoc strcspn_#t~mem6; 650#L512 SUMMARY for call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L512 651#L512-1 SUMMARY for call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L512-1 653#L512-2 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 663#L511-4 strcspn_#t~pre3 := strcspn_~i~0 + 1;strcspn_~i~0 := strcspn_~i~0 + 1;havoc strcspn_#t~pre3; 669#L511-5 assume true; 675#L511-1 SUMMARY for call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L511-1 671#L511-2 assume !(strcspn_#t~mem6 != 0);havoc strcspn_#t~mem6; 643#L511-6 strcspn_#t~pre7 := strcspn_~l~0 + 1;strcspn_~l~0 := strcspn_~l~0 + 1;havoc strcspn_#t~pre7; 644#L510-4 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, strcspn_~s.offset + 1;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, strcspn_~s.offset + 1;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 640#L510-5 assume true; 642#L510-1 SUMMARY for call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L510-1 665#L510-2 assume !!(strcspn_#t~mem8 != 0);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 667#L511-5 [2018-11-10 02:35:25,802 INFO L795 eck$LassoCheckResult]: Loop: 667#L511-5 assume true; 658#L511-1 SUMMARY for call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L511-1 659#L511-2 assume !!(strcspn_#t~mem6 != 0);havoc strcspn_#t~mem6; 648#L512 SUMMARY for call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L512 649#L512-1 SUMMARY for call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L512-1 652#L512-2 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 662#L511-4 strcspn_#t~pre3 := strcspn_~i~0 + 1;strcspn_~i~0 := strcspn_~i~0 + 1;havoc strcspn_#t~pre3; 667#L511-5 [2018-11-10 02:35:25,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:25,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1112516211, now seen corresponding path program 2 times [2018-11-10 02:35:25,802 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:25,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:25,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:25,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:35:25,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:25,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:25,820 INFO L82 PathProgramCache]: Analyzing trace with hash -774959707, now seen corresponding path program 3 times [2018-11-10 02:35:25,820 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:25,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:25,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:25,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:35:25,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:25,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:25,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1708990105, now seen corresponding path program 3 times [2018-11-10 02:35:25,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:25,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:25,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:25,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:35:25,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:26,278 WARN L179 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 157 [2018-11-10 02:35:26,383 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-11-10 02:35:26,384 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:35:26,384 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:35:26,384 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:35:26,384 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:35:26,384 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:35:26,384 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:35:26,384 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:35:26,385 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:35:26,385 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration5_Lasso [2018-11-10 02:35:26,385 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:35:26,385 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:35:26,387 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-10 02:35:26,401 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-10 02:35:26,403 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-10 02:35:26,404 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-10 02:35:26,405 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-10 02:35:26,406 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-10 02:35:26,407 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-10 02:35:26,409 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-10 02:35:26,410 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-10 02:35:26,411 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-10 02:35:26,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-10 02:35:26,413 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-10 02:35:26,414 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-10 02:35:26,766 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 116 [2018-11-10 02:35:26,867 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-10 02:35:26,869 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-10 02:35:26,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-10 02:35:26,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-10 02:35:27,086 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2018-11-10 02:35:27,283 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-11-10 02:35:27,445 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:35:27,445 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:35:27,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:27,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:27,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:27,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:27,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:27,448 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:27,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:27,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:27,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:27,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:27,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:27,451 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:27,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:27,453 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:27,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:27,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:27,455 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:27,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:27,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:27,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:27,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:27,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:27,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:27,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:27,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:27,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:27,459 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:27,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:27,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:27,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:27,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:27,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:27,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:27,462 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:27,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:27,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:27,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:27,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:27,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:27,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:27,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,472 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-10 02:35:27,472 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-10 02:35:27,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,482 INFO L402 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2018-11-10 02:35:27,483 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-10 02:35:27,526 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:27,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:27,529 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:27,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:27,531 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:27,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:27,534 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:27,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:27,536 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:27,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:27,539 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,539 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:35:27,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,540 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:35:27,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:27,545 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:27,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:27,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:27,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:27,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:27,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:27,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:27,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:27,571 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:35:27,589 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 02:35:27,590 INFO L444 ModelExtractionUtils]: 64 out of 70 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 02:35:27,590 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:35:27,590 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:35:27,591 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:35:27,591 INFO L519 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-10 02:35:27,679 INFO L297 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2018-11-10 02:35:27,680 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 02:35:27,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:27,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:27,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:27,786 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-10 02:35:27,787 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2018-11-10 02:35:27,787 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 48 transitions. cyclomatic complexity: 6 Second operand 9 states. [2018-11-10 02:35:27,820 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 48 transitions. cyclomatic complexity: 6. Second operand 9 states. Result 45 states and 48 transitions. Complement of second has 6 states. [2018-11-10 02:35:27,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-10 02:35:27,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 02:35:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-10 02:35:27,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 26 letters. Loop has 7 letters. [2018-11-10 02:35:27,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:27,820 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:35:27,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:27,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:27,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:27,920 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-10 02:35:27,920 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 3 loop predicates [2018-11-10 02:35:27,921 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 48 transitions. cyclomatic complexity: 6 Second operand 9 states. [2018-11-10 02:35:27,959 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 48 transitions. cyclomatic complexity: 6. Second operand 9 states. Result 45 states and 48 transitions. Complement of second has 6 states. [2018-11-10 02:35:27,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-10 02:35:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 02:35:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-10 02:35:27,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 26 letters. Loop has 7 letters. [2018-11-10 02:35:27,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:27,960 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:35:27,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:27,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:28,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:28,066 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-10 02:35:28,066 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2018-11-10 02:35:28,066 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 48 transitions. cyclomatic complexity: 6 Second operand 9 states. [2018-11-10 02:35:28,161 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 48 transitions. cyclomatic complexity: 6. Second operand 9 states. Result 90 states and 97 transitions. Complement of second has 14 states. [2018-11-10 02:35:28,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 5 stem states 3 non-accepting loop states 2 accepting loop states [2018-11-10 02:35:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 02:35:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2018-11-10 02:35:28,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 59 transitions. Stem has 26 letters. Loop has 7 letters. [2018-11-10 02:35:28,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:28,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 59 transitions. Stem has 33 letters. Loop has 7 letters. [2018-11-10 02:35:28,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:28,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 59 transitions. Stem has 26 letters. Loop has 14 letters. [2018-11-10 02:35:28,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:28,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 97 transitions. [2018-11-10 02:35:28,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:35:28,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 66 states and 70 transitions. [2018-11-10 02:35:28,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 02:35:28,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 02:35:28,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 70 transitions. [2018-11-10 02:35:28,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:35:28,166 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-10 02:35:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 70 transitions. [2018-11-10 02:35:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-11-10 02:35:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 02:35:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-10 02:35:28,169 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-10 02:35:28,169 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-10 02:35:28,169 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 02:35:28,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 64 transitions. [2018-11-10 02:35:28,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:35:28,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:35:28,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:35:28,172 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:28,172 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:35:28,172 INFO L793 eck$LassoCheckResult]: Stem: 1411#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1401#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1402#L519 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; 1403#L521 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L521 1404#L521-1 main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 1394#L523 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 1392#L525 SUMMARY for call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L525 1393#L525-1 assume { :begin_inline_strcspn } true;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; 1386#L510-5 assume true; 1387#L510-1 SUMMARY for call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L510-1 1435#L510-2 assume !!(strcspn_#t~mem8 != 0);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1434#L511-5 assume true; 1428#L511-1 SUMMARY for call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L511-1 1433#L511-2 assume !!(strcspn_#t~mem6 != 0);havoc strcspn_#t~mem6; 1432#L512 SUMMARY for call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L512 1431#L512-1 SUMMARY for call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L512-1 1430#L512-2 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 1429#L511-4 strcspn_#t~pre3 := strcspn_~i~0 + 1;strcspn_~i~0 := strcspn_~i~0 + 1;havoc strcspn_#t~pre3; 1427#L511-5 assume true; 1426#L511-1 SUMMARY for call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L511-1 1425#L511-2 assume !(strcspn_#t~mem6 != 0);havoc strcspn_#t~mem6; 1390#L511-6 strcspn_#t~pre7 := strcspn_~l~0 + 1;strcspn_~l~0 := strcspn_~l~0 + 1;havoc strcspn_#t~pre7; 1391#L510-4 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, strcspn_~s.offset + 1;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, strcspn_~s.offset + 1;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1388#L510-5 assume true; 1389#L510-1 SUMMARY for call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L510-1 1414#L510-2 assume !!(strcspn_#t~mem8 != 0);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1417#L511-5 assume true; 1407#L511-1 SUMMARY for call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L511-1 1408#L511-2 assume !!(strcspn_#t~mem6 != 0);havoc strcspn_#t~mem6; 1442#L512 SUMMARY for call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L512 1441#L512-1 SUMMARY for call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L512-1 1440#L512-2 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 1439#L511-4 strcspn_#t~pre3 := strcspn_~i~0 + 1;strcspn_~i~0 := strcspn_~i~0 + 1;havoc strcspn_#t~pre3; 1438#L511-5 assume true; 1424#L511-1 SUMMARY for call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L511-1 1423#L511-2 assume !(strcspn_#t~mem6 != 0);havoc strcspn_#t~mem6; 1422#L511-6 strcspn_#t~pre7 := strcspn_~l~0 + 1;strcspn_~l~0 := strcspn_~l~0 + 1;havoc strcspn_#t~pre7; 1421#L510-4 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, strcspn_~s.offset + 1;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, strcspn_~s.offset + 1;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1419#L510-5 assume true; 1412#L510-1 SUMMARY for call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L510-1 1413#L510-2 assume !!(strcspn_#t~mem8 != 0);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1416#L511-5 [2018-11-10 02:35:28,172 INFO L795 eck$LassoCheckResult]: Loop: 1416#L511-5 assume true; 1405#L511-1 SUMMARY for call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L511-1 1406#L511-2 assume !!(strcspn_#t~mem6 != 0);havoc strcspn_#t~mem6; 1395#L512 SUMMARY for call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); srcloc: L512 1396#L512-1 SUMMARY for call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0 * 1, 1); srcloc: L512-1 1399#L512-2 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem5;havoc strcspn_#t~mem4; 1409#L511-4 strcspn_#t~pre3 := strcspn_~i~0 + 1;strcspn_~i~0 := strcspn_~i~0 + 1;havoc strcspn_#t~pre3; 1416#L511-5 [2018-11-10 02:35:28,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:28,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1411865073, now seen corresponding path program 4 times [2018-11-10 02:35:28,173 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:28,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:28,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:28,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:35:28,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:28,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:28,190 INFO L82 PathProgramCache]: Analyzing trace with hash -774959707, now seen corresponding path program 4 times [2018-11-10 02:35:28,190 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:28,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:28,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:28,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:35:28,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:28,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:28,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1415584727, now seen corresponding path program 5 times [2018-11-10 02:35:28,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:35:28,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:35:28,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:28,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:35:28,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:35:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:35:28,831 WARN L179 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 183 [2018-11-10 02:35:28,941 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-10 02:35:28,942 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:35:28,942 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:35:28,942 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:35:28,942 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:35:28,942 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:35:28,942 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:35:28,942 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:35:28,942 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:35:28,942 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcspn_true-termination.c.i_Iteration6_Lasso [2018-11-10 02:35:28,942 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:35:28,943 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:35:28,945 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-10 02:35:28,946 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-10 02:35:28,947 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-10 02:35:28,948 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-10 02:35:28,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:28,951 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-10 02:35:28,952 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-10 02:35:28,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:28,955 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-10 02:35:28,955 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-10 02:35:28,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:28,957 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-10 02:35:28,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:28,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:28,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:28,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:29,267 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 112 [2018-11-10 02:35:29,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:35:29,496 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 02:35:30,320 WARN L179 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2018-11-10 02:35:30,339 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:35:30,339 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:35:30,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:30,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:30,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:30,342 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:30,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:30,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:30,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:30,344 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:30,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:30,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:30,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:30,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,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-10 02:35:30,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:30,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:30,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:30,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:30,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:30,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:30,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:30,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:30,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:30,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:30,350 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:30,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:30,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:30,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:30,351 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,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-10 02:35:30,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:30,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:30,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:30,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,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-10 02:35:30,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:30,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:30,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:30,354 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:30,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:30,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:30,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:30,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,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-10 02:35:30,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:30,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:30,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:30,356 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:30,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:30,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:30,360 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,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-10 02:35:30,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:30,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:30,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:30,361 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:30,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:30,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:30,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:30,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:30,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:35:30,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:35:30,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:35:30,366 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:30,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:30,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:30,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:30,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:30,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:30,375 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:30,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:30,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:30,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-10 02:35:30,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,378 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:35:30,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,379 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:35:30,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:30,384 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:35:30,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:35:30,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:35:30,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:35:30,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:35:30,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:35:30,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:35:30,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:35:30,401 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:35:30,421 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 02:35:30,422 INFO L444 ModelExtractionUtils]: 43 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 02:35:30,422 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:35:30,422 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:35:30,423 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:35:30,423 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4, ULTIMATE.start_strcspn_~reject.offset) = -1*ULTIMATE.start_strcspn_~i~0 + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4 - 1*ULTIMATE.start_strcspn_~reject.offset Supporting invariants [] [2018-11-10 02:35:30,530 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2018-11-10 02:35:30,531 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 02:35:30,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:30,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:30,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:30,567 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-10 02:35:30,567 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-10 02:35:30,567 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 64 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 02:35:30,576 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 64 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 73 states and 78 transitions. Complement of second has 7 states. [2018-11-10 02:35:30,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:35:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:35:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 02:35:30,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 41 letters. Loop has 7 letters. [2018-11-10 02:35:30,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:30,578 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:35:30,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:30,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:30,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:30,618 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-10 02:35:30,618 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-10 02:35:30,618 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 64 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 02:35:30,627 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 64 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 73 states and 78 transitions. Complement of second has 7 states. [2018-11-10 02:35:30,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:35:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:35:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 02:35:30,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 41 letters. Loop has 7 letters. [2018-11-10 02:35:30,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:30,629 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:35:30,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:35:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:30,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:35:30,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:35:30,679 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-10 02:35:30,680 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-10 02:35:30,680 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 64 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 02:35:30,689 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 64 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 103 states and 112 transitions. Complement of second has 6 states. [2018-11-10 02:35:30,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:35:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:35:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-11-10 02:35:30,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 41 letters. Loop has 7 letters. [2018-11-10 02:35:30,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:30,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 48 letters. Loop has 7 letters. [2018-11-10 02:35:30,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:30,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 41 letters. Loop has 14 letters. [2018-11-10 02:35:30,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:35:30,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 112 transitions. [2018-11-10 02:35:30,693 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:35:30,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 0 states and 0 transitions. [2018-11-10 02:35:30,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 02:35:30,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 02:35:30,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 02:35:30,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:35:30,693 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:35:30,693 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:35:30,693 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:35:30,693 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 02:35:30,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 02:35:30,693 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:35:30,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 02:35:30,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 02:35:30 BoogieIcfgContainer [2018-11-10 02:35:30,697 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 02:35:30,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:35:30,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:35:30,698 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:35:30,698 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:35:22" (3/4) ... [2018-11-10 02:35:30,701 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 02:35:30,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:35:30,702 INFO L168 Benchmark]: Toolchain (without parser) took 8963.62 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 377.0 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -209.1 MB). Peak memory consumption was 167.9 MB. Max. memory is 11.5 GB. [2018-11-10 02:35:30,703 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:35:30,703 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.24 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 02:35:30,703 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 02:35:30,704 INFO L168 Benchmark]: Boogie Preprocessor took 18.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:35:30,704 INFO L168 Benchmark]: RCFGBuilder took 186.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-11-10 02:35:30,705 INFO L168 Benchmark]: BuchiAutomizer took 8392.65 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 259.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -78.6 MB). Peak memory consumption was 180.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:35:30,705 INFO L168 Benchmark]: Witness Printer took 3.62 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:35:30,708 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 289.24 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 186.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8392.65 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 259.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -78.6 MB). Peak memory consumption was 180.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.62 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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[__builtin_alloca (in_len)] and consists of 5 locations. One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[reject] + -1 * reject and consists of 4 locations. One nondeterministic module has affine ranking function -2 * i + 3 * unknown-#length-unknown[reject] and consists of 10 locations. One nondeterministic module has affine ranking function -1 * i + unknown-#length-unknown[reject] + -1 * reject and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 7.2s. 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, 30 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 60 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 189 SDtfs, 345 SDslu, 144 SDs, 0 SdLazy, 155 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital258 mio100 ax100 hnf99 lsp95 ukn96 mio100 lsp39 div100 bol100 ite100 ukn100 eq191 hnf87 smp99 dnf436 smp77 tf100 neg91 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 54ms 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...