./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-libowfat/strcspn.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-libowfat/strcspn.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-30f4e4a [2019-11-28 02:59:38,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:59:38,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:59:38,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:59:38,123 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:59:38,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:59:38,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:59:38,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:59:38,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:59:38,145 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:59:38,146 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:59:38,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:59:38,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:59:38,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:59:38,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:59:38,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:59:38,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:59:38,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:59:38,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:59:38,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:59:38,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:59:38,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:59:38,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:59:38,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:59:38,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:59:38,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:59:38,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:59:38,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:59:38,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:59:38,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:59:38,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:59:38,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:59:38,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:59:38,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:59:38,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:59:38,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:59:38,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:59:38,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:59:38,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:59:38,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:59:38,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:59:38,196 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 02:59:38,228 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:59:38,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:59:38,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:59:38,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:59:38,232 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:59:38,232 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 02:59:38,232 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 02:59:38,233 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 02:59:38,233 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 02:59:38,233 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 02:59:38,235 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 02:59:38,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:59:38,235 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:59:38,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:59:38,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:59:38,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 02:59:38,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 02:59:38,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 02:59:38,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:59:38,238 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 02:59:38,238 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:59:38,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 02:59:38,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:59:38,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:59:38,239 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 02:59:38,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:59:38,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:59:38,240 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 02:59:38,241 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 02:59:38,242 INFO L138 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-11-28 02:59:38,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:59:38,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:59:38,628 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:59:38,629 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:59:38,630 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:59:38,632 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-libowfat/strcspn.i [2019-11-28 02:59:38,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ed5b246/eab797521be74b0a96dd57fbaccee8aa/FLAG93d41b27d [2019-11-28 02:59:39,228 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:59:39,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-libowfat/strcspn.i [2019-11-28 02:59:39,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ed5b246/eab797521be74b0a96dd57fbaccee8aa/FLAG93d41b27d [2019-11-28 02:59:39,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ed5b246/eab797521be74b0a96dd57fbaccee8aa [2019-11-28 02:59:39,539 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:59:39,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:59:39,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:59:39,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:59:39,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:59:39,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:59:39" (1/1) ... [2019-11-28 02:59:39,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2277f3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:39, skipping insertion in model container [2019-11-28 02:59:39,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:59:39" (1/1) ... [2019-11-28 02:59:39,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:59:39,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:59:40,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:59:40,120 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:59:40,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:59:40,222 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:59:40,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:40 WrapperNode [2019-11-28 02:59:40,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:59:40,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:59:40,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:59:40,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:59:40,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:40" (1/1) ... [2019-11-28 02:59:40,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:40" (1/1) ... [2019-11-28 02:59:40,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:59:40,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:59:40,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:59:40,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:59:40,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:40" (1/1) ... [2019-11-28 02:59:40,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:40" (1/1) ... [2019-11-28 02:59:40,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:40" (1/1) ... [2019-11-28 02:59:40,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:40" (1/1) ... [2019-11-28 02:59:40,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:40" (1/1) ... [2019-11-28 02:59:40,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:40" (1/1) ... [2019-11-28 02:59:40,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:40" (1/1) ... [2019-11-28 02:59:40,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:59:40,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:59:40,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:59:40,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:59:40,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 02:59:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:59:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:59:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:59:40,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:59:40,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:59:40,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:59:40,760 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:59:40,760 INFO L297 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 02:59:40,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:59:40 BoogieIcfgContainer [2019-11-28 02:59:40,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:59:40,763 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 02:59:40,763 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 02:59:40,767 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 02:59:40,768 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:59:40,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 02:59:39" (1/3) ... [2019-11-28 02:59:40,769 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e5f092a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:59:40, skipping insertion in model container [2019-11-28 02:59:40,769 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:59:40,770 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:40" (2/3) ... [2019-11-28 02:59:40,770 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e5f092a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:59:40, skipping insertion in model container [2019-11-28 02:59:40,770 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:59:40,771 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:59:40" (3/3) ... [2019-11-28 02:59:40,773 INFO L371 chiAutomizerObserver]: Analyzing ICFG strcspn.i [2019-11-28 02:59:40,824 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 02:59:40,824 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 02:59:40,825 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 02:59:40,825 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:59:40,825 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:59:40,825 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 02:59:40,826 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:59:40,826 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 02:59:40,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-28 02:59:40,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 02:59:40,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:40,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:40,869 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:59:40,869 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 02:59:40,870 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 02:59:40,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-28 02:59:40,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 02:59:40,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:40,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:40,872 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:59:40,872 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 02:59:40,879 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 12#L519true assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 6#L523true assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 18#L510-4true [2019-11-28 02:59:40,879 INFO L796 eck$LassoCheckResult]: Loop: 18#L510-4true call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 11#L510-1true assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 15#L511-4true assume !true; 19#L511-5true strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 16#L510-3true strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 18#L510-4true [2019-11-28 02:59:40,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:40,885 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-11-28 02:59:40,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:40,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115787568] [2019-11-28 02:59:40,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:41,058 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:41,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:41,060 INFO L82 PathProgramCache]: Analyzing trace with hash 44069891, now seen corresponding path program 1 times [2019-11-28 02:59:41,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:41,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125060788] [2019-11-28 02:59:41,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:41,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125060788] [2019-11-28 02:59:41,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:59:41,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:59:41,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048708903] [2019-11-28 02:59:41,101 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:41,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:41,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 02:59:41,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 02:59:41,118 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-11-28 02:59:41,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:41,124 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-11-28 02:59:41,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 02:59:41,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-11-28 02:59:41,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 02:59:41,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 13 transitions. [2019-11-28 02:59:41,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 02:59:41,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 02:59:41,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-11-28 02:59:41,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:59:41,134 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-28 02:59:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-11-28 02:59:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-28 02:59:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 02:59:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-11-28 02:59:41,159 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-28 02:59:41,159 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-28 02:59:41,160 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 02:59:41,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-11-28 02:59:41,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 02:59:41,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:41,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:41,161 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:59:41,162 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:59:41,162 INFO L794 eck$LassoCheckResult]: Stem: 47#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 42#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 43#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 50#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 53#L510-4 [2019-11-28 02:59:41,162 INFO L796 eck$LassoCheckResult]: Loop: 53#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 48#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 49#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 44#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 45#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 52#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 53#L510-4 [2019-11-28 02:59:41,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:41,163 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2019-11-28 02:59:41,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:41,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606002349] [2019-11-28 02:59:41,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:41,208 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:41,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:41,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1365737035, now seen corresponding path program 1 times [2019-11-28 02:59:41,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:41,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190375342] [2019-11-28 02:59:41,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:41,231 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:41,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:41,233 INFO L82 PathProgramCache]: Analyzing trace with hash 736220402, now seen corresponding path program 1 times [2019-11-28 02:59:41,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:41,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122156828] [2019-11-28 02:59:41,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:41,357 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:41,898 WARN L192 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2019-11-28 02:59:42,057 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-28 02:59:42,072 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:42,073 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:42,073 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:42,073 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:42,074 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:42,074 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:42,074 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:42,075 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:42,075 INFO L133 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration2_Lasso [2019-11-28 02:59:42,075 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:42,076 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:42,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:42,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:42,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:42,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:42,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:42,553 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-11-28 02:59:42,704 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-28 02:59:42,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:42,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:42,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:42,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:42,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:42,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:42,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:42,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:42,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:42,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:42,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:42,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:43,287 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:43,293 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:43,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:43,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:43,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:43,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:43,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:43,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:43,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:43,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:43,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:43,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:43,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:43,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:43,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:43,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:43,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:43,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:43,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:43,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:43,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:43,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:43,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:43,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:43,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:43,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:43,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:43,378 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:43,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:43,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:43,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:43,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:43,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:43,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:43,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:43,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:43,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:43,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:43,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:43,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:43,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:43,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:43,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:43,487 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:43,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:43,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:43,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:43,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:43,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:43,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:43,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:43,572 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:43,698 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 02:59:43,698 INFO L444 ModelExtractionUtils]: 13 out of 25 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:43,706 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:43,710 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 02:59:43,711 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:43,712 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~s.offset, v_rep(select #length ULTIMATE.start_strcspn_~s.base)_1) = -1*ULTIMATE.start_strcspn_~s.offset + 1*v_rep(select #length ULTIMATE.start_strcspn_~s.base)_1 Supporting invariants [] [2019-11-28 02:59:43,784 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-11-28 02:59:43,796 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 02:59:43,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:43,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:43,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:43,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:59:43,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:43,913 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 [2019-11-28 02:59:43,914 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 3 states. [2019-11-28 02:59:43,960 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 20 states and 23 transitions. Complement of second has 4 states. [2019-11-28 02:59:43,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:43,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:59:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-11-28 02:59:43,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 02:59:43,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:43,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 02:59:43,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:43,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 02:59:43,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:43,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2019-11-28 02:59:43,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:59:43,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 21 transitions. [2019-11-28 02:59:43,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 02:59:43,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 02:59:43,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-28 02:59:43,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:43,970 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-28 02:59:43,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-28 02:59:43,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-28 02:59:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 02:59:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-11-28 02:59:43,972 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-28 02:59:43,973 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-28 02:59:43,973 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 02:59:43,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-11-28 02:59:43,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:59:43,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:43,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:43,974 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:59:43,975 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:43,975 INFO L794 eck$LassoCheckResult]: Stem: 191#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 184#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 185#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 196#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 199#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 192#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 193#L511-4 [2019-11-28 02:59:43,975 INFO L796 eck$LassoCheckResult]: Loop: 193#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 186#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 187#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 197#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 193#L511-4 [2019-11-28 02:59:43,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:43,976 INFO L82 PathProgramCache]: Analyzing trace with hash 889571309, now seen corresponding path program 1 times [2019-11-28 02:59:43,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:43,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337804121] [2019-11-28 02:59:43,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:44,015 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:44,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:44,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 1 times [2019-11-28 02:59:44,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:44,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732130656] [2019-11-28 02:59:44,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:44,029 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:44,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:44,030 INFO L82 PathProgramCache]: Analyzing trace with hash 736222132, now seen corresponding path program 1 times [2019-11-28 02:59:44,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:44,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321923541] [2019-11-28 02:59:44,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:44,075 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:44,689 WARN L192 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2019-11-28 02:59:44,847 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-28 02:59:44,850 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:44,850 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:44,850 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:44,850 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:44,851 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:44,851 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:44,851 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:44,851 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:44,851 INFO L133 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration3_Lasso [2019-11-28 02:59:44,851 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:44,851 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:44,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:44,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:44,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:44,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:44,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:44,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:45,214 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-11-28 02:59:45,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:45,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:45,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:45,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:45,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:45,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:45,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:45,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:45,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:45,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:45,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:45,760 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:45,760 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:45,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:45,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:45,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:45,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:45,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:45,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:45,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:45,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:45,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:45,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:45,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:45,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:45,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:45,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:45,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:45,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:45,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:45,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:45,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:45,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:45,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:45,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:45,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:45,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:45,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:45,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:45,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:45,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:45,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:45,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:45,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:45,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:45,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:45,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:45,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:45,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:45,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:45,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:45,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:45,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:45,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:45,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:45,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:45,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:45,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:45,894 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 02:59:45,894 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2019-11-28 02:59:45,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:45,916 INFO L401 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2019-11-28 02:59:45,916 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-11-28 02:59:45,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:45,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:45,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:45,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:45,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:45,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:45,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:45,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:45,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:46,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:46,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:46,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:46,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:46,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:46,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:46,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:46,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:46,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:46,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:46,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:46,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:46,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:46,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:46,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:46,074 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:46,110 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-28 02:59:46,110 INFO L444 ModelExtractionUtils]: 16 out of 28 variables were initially zero. Simplification set additionally 8 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:46,115 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:46,117 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 02:59:46,118 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:46,118 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_2) = -1*ULTIMATE.start_strcspn_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_2 Supporting invariants [1*ULTIMATE.start_strcspn_~reject.offset >= 0] [2019-11-28 02:59:46,184 INFO L297 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2019-11-28 02:59:46,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 02:59:46,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:46,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:59:46,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:46,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:59:46,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:46,301 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 [2019-11-28 02:59:46,301 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-28 02:59:46,349 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 45 states and 51 transitions. Complement of second has 6 states. [2019-11-28 02:59:46,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:46,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:59:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-28 02:59:46,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 02:59:46,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:46,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 02:59:46,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:46,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 6 letters. Loop has 8 letters. [2019-11-28 02:59:46,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:46,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2019-11-28 02:59:46,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:59:46,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 33 transitions. [2019-11-28 02:59:46,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 02:59:46,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 02:59:46,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2019-11-28 02:59:46,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:46,357 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-28 02:59:46,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2019-11-28 02:59:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-11-28 02:59:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 02:59:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-11-28 02:59:46,361 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-28 02:59:46,361 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-28 02:59:46,361 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 02:59:46,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2019-11-28 02:59:46,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:59:46,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:46,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:46,363 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:59:46,364 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:46,364 INFO L794 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 373#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 374#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 384#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 387#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 382#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 383#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 396#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 395#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 390#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 391#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 380#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 381#L511-4 [2019-11-28 02:59:46,364 INFO L796 eck$LassoCheckResult]: Loop: 381#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 375#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 376#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 385#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 381#L511-4 [2019-11-28 02:59:46,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:46,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1161797001, now seen corresponding path program 2 times [2019-11-28 02:59:46,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:46,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282070885] [2019-11-28 02:59:46,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:46,417 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:46,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:46,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 2 times [2019-11-28 02:59:46,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:46,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112141113] [2019-11-28 02:59:46,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:46,446 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:46,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:46,447 INFO L82 PathProgramCache]: Analyzing trace with hash -967302850, now seen corresponding path program 1 times [2019-11-28 02:59:46,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:46,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569021414] [2019-11-28 02:59:46,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:46,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569021414] [2019-11-28 02:59:46,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537039159] [2019-11-28 02:59:46,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:46,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:59:46,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:46,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 02:59:46,809 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:59:46,815 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:59:46,815 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:59:46,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-28 02:59:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:46,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:46,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-28 02:59:46,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428726388] [2019-11-28 02:59:46,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:46,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:59:46,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:59:46,875 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 13 states. [2019-11-28 02:59:47,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:47,025 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2019-11-28 02:59:47,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:59:47,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 51 transitions. [2019-11-28 02:59:47,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:59:47,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 39 transitions. [2019-11-28 02:59:47,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 02:59:47,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 02:59:47,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2019-11-28 02:59:47,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:47,033 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-11-28 02:59:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2019-11-28 02:59:47,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-11-28 02:59:47,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 02:59:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-28 02:59:47,038 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-28 02:59:47,039 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-28 02:59:47,039 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 02:59:47,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2019-11-28 02:59:47,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:59:47,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:47,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:47,043 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:59:47,043 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:47,043 INFO L794 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 513#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 514#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 524#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 528#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 532#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 529#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 517#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 518#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 526#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 527#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 534#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 533#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 530#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 531#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 520#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 521#L511-4 [2019-11-28 02:59:47,043 INFO L796 eck$LassoCheckResult]: Loop: 521#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 515#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 516#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 525#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 521#L511-4 [2019-11-28 02:59:47,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:47,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1375356158, now seen corresponding path program 2 times [2019-11-28 02:59:47,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:47,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474236169] [2019-11-28 02:59:47,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:47,089 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:47,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:47,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 3 times [2019-11-28 02:59:47,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:47,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892026935] [2019-11-28 02:59:47,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:47,099 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:47,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:47,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1858115515, now seen corresponding path program 3 times [2019-11-28 02:59:47,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:47,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058779889] [2019-11-28 02:59:47,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:47,136 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:47,854 WARN L192 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 138 [2019-11-28 02:59:48,041 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-28 02:59:48,046 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:48,046 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:48,046 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:48,046 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:48,046 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:48,046 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:48,046 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:48,046 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:48,046 INFO L133 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration5_Lasso [2019-11-28 02:59:48,047 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:48,047 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:48,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,636 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-11-28 02:59:48,798 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-11-28 02:59:48,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:48,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:49,082 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-28 02:59:49,797 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-11-28 02:59:49,858 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:49,858 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:49,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:49,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:49,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:49,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:49,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:49,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:49,876 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:49,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:49,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:49,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:49,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:49,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:49,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:49,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:49,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:49,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:49,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:49,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:49,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:49,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:49,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:49,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:49,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:49,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:49,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:49,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:49,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:49,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:49,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:49,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:49,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:49,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:49,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:49,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:49,918 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:49,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:49,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:49,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:49,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:49,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:49,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:49,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:49,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:49,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:49,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:49,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:49,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:49,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:49,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:49,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:49,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:49,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:49,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:49,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:49,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:49,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:49,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:49,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:49,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:49,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:49,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:49,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:49,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:49,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:49,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:49,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:49,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:49,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:49,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:49,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:49,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:49,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:49,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:49,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:49,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:49,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:49,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:50,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:50,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:50,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:50,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:50,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:50,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:50,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:50,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:50,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:50,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:50,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:50,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:50,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:50,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:50,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:50,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:50,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:50,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:50,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:50,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:50,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:50,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:50,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:50,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:50,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:50,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:50,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:50,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:50,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:50,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:50,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:50,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:50,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:50,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:50,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:50,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:50,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:50,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:50,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:50,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:50,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:50,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:50,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:50,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:50,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:50,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:50,132 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:50,153 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:50,203 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 02:59:50,204 INFO L444 ModelExtractionUtils]: 21 out of 49 variables were initially zero. Simplification set additionally 25 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:50,213 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:50,217 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 02:59:50,217 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:50,218 INFO L512 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 [] [2019-11-28 02:59:50,365 INFO L297 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2019-11-28 02:59:50,368 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 02:59:50,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:50,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 02:59:50,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:50,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:50,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:50,532 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2019-11-28 02:59:50,534 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-11-28 02:59:50,584 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 27 states and 30 transitions. Complement of second has 5 states. [2019-11-28 02:59:50,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:50,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:59:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-11-28 02:59:50,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 16 letters. Loop has 4 letters. [2019-11-28 02:59:50,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:50,586 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:50,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:50,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 02:59:50,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:50,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:50,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:50,742 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2019-11-28 02:59:50,743 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-11-28 02:59:50,799 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 27 states and 30 transitions. Complement of second has 5 states. [2019-11-28 02:59:50,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:59:50,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-11-28 02:59:50,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 16 letters. Loop has 4 letters. [2019-11-28 02:59:50,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:50,803 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:50,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:50,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 02:59:50,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:50,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:50,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:50,960 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2019-11-28 02:59:50,961 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-11-28 02:59:51,122 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 56 states and 63 transitions. Complement of second has 11 states. [2019-11-28 02:59:51,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-28 02:59:51,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:59:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2019-11-28 02:59:51,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 16 letters. Loop has 4 letters. [2019-11-28 02:59:51,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:51,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 20 letters. Loop has 4 letters. [2019-11-28 02:59:51,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:51,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 16 letters. Loop has 8 letters. [2019-11-28 02:59:51,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:51,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 63 transitions. [2019-11-28 02:59:51,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:59:51,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 42 states and 46 transitions. [2019-11-28 02:59:51,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 02:59:51,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 02:59:51,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2019-11-28 02:59:51,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:51,131 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-28 02:59:51,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2019-11-28 02:59:51,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2019-11-28 02:59:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 02:59:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-28 02:59:51,137 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-28 02:59:51,138 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-28 02:59:51,138 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 02:59:51,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2019-11-28 02:59:51,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:59:51,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:51,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:51,140 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-28 02:59:51,140 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:51,140 INFO L794 eck$LassoCheckResult]: Stem: 1050#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1044#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 1045#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 1055#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 1062#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1063#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1074#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1071#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1073#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1072#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1070#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1069#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1068#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1059#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1060#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1064#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1061#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1048#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1049#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1057#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1058#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1075#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1065#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1066#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1067#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1051#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1052#L511-4 [2019-11-28 02:59:51,140 INFO L796 eck$LassoCheckResult]: Loop: 1052#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1046#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1047#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1056#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1052#L511-4 [2019-11-28 02:59:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:51,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1550213327, now seen corresponding path program 4 times [2019-11-28 02:59:51,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:51,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239983103] [2019-11-28 02:59:51,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:51,186 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:51,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:51,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 4 times [2019-11-28 02:59:51,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:51,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770614426] [2019-11-28 02:59:51,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:51,203 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:51,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:51,207 INFO L82 PathProgramCache]: Analyzing trace with hash 229061526, now seen corresponding path program 5 times [2019-11-28 02:59:51,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:51,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074939349] [2019-11-28 02:59:51,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:51,276 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:52,241 WARN L192 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 167 [2019-11-28 02:59:52,444 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-28 02:59:52,447 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:52,447 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:52,447 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:52,447 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:52,448 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:52,448 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:52,448 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:52,448 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:52,448 INFO L133 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration6_Lasso [2019-11-28 02:59:52,448 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:52,448 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:52,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:52,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:52,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:52,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:52,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:52,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:52,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:52,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:52,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:52,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:52,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:52,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:52,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:53,051 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 88 [2019-11-28 02:59:53,191 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-11-28 02:59:53,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:53,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:53,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:53,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:53,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:53,380 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-11-28 02:59:53,541 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-28 02:59:55,396 WARN L192 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-11-28 02:59:55,510 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:55,510 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:55,523 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:55,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:55,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:55,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:55,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:55,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:55,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:55,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:55,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:55,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:55,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:55,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:55,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:55,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:55,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:55,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:55,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:55,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:55,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:55,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:55,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:55,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:55,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:55,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:55,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:55,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:55,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:55,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:55,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:55,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:55,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:55,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:55,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:55,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:55,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:55,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:55,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:55,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:55,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:55,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:55,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:55,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:55,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:55,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:55,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:55,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:55,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:55,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:55,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:55,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:55,797 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:55,850 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-11-28 02:59:55,850 INFO L444 ModelExtractionUtils]: 10 out of 40 variables were initially zero. Simplification set additionally 27 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:55,854 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:55,856 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 02:59:55,856 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:55,856 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4) = -2*ULTIMATE.start_strcspn_~i~0 + 5*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4 Supporting invariants [] [2019-11-28 02:59:56,003 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2019-11-28 02:59:56,006 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 02:59:56,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:56,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 02:59:56,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:56,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:56,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:56,184 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 [2019-11-28 02:59:56,185 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-28 02:59:56,236 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 37 states and 41 transitions. Complement of second has 5 states. [2019-11-28 02:59:56,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:59:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-11-28 02:59:56,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 26 letters. Loop has 4 letters. [2019-11-28 02:59:56,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:56,241 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:56,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:56,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 02:59:56,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:56,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:56,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:56,423 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 [2019-11-28 02:59:56,424 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-28 02:59:56,487 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 37 states and 41 transitions. Complement of second has 5 states. [2019-11-28 02:59:56,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:59:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-11-28 02:59:56,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 26 letters. Loop has 4 letters. [2019-11-28 02:59:56,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:56,491 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:56,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:56,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 02:59:56,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:56,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:56,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:56,668 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 [2019-11-28 02:59:56,668 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-28 02:59:56,873 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 66 states and 74 transitions. Complement of second has 13 states. [2019-11-28 02:59:56,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-28 02:59:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:59:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2019-11-28 02:59:56,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 26 letters. Loop has 4 letters. [2019-11-28 02:59:56,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:56,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 30 letters. Loop has 4 letters. [2019-11-28 02:59:56,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:56,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 26 letters. Loop has 8 letters. [2019-11-28 02:59:56,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:56,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 74 transitions. [2019-11-28 02:59:56,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:59:56,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 52 states and 57 transitions. [2019-11-28 02:59:56,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 02:59:56,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 02:59:56,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 57 transitions. [2019-11-28 02:59:56,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:56,884 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-11-28 02:59:56,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 57 transitions. [2019-11-28 02:59:56,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2019-11-28 02:59:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 02:59:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-11-28 02:59:56,890 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-11-28 02:59:56,890 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-11-28 02:59:56,890 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 02:59:56,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 52 transitions. [2019-11-28 02:59:56,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:59:56,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:56,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:56,893 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-11-28 02:59:56,893 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:56,893 INFO L794 eck$LassoCheckResult]: Stem: 1714#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1708#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 1709#L519 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 1719#L523 assume !(main_~out_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcspn_#res;havoc strcspn_#t~mem4, strcspn_#t~mem5, strcspn_#t~pre3, strcspn_#t~mem6, strcspn_#t~pre7, strcspn_#t~pre2.base, strcspn_#t~pre2.offset, strcspn_#t~mem8, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~0, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~0 := 0;havoc strcspn_~i~0; 1727#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1730#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1754#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1751#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1753#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1752#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1750#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1749#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1748#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1747#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1731#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1717#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1718#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1740#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1741#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1721#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1722#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1737#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1729#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1725#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1726#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1746#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1723#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1724#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1744#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1743#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1742#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1736#L511-1 assume !(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6; 1735#L511-5 strcspn_#t~pre7 := 1 + strcspn_~l~0;strcspn_~l~0 := 1 + strcspn_~l~0;havoc strcspn_#t~pre7; 1734#L510-3 strcspn_#t~pre2.base, strcspn_#t~pre2.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre2.base, strcspn_#t~pre2.offset; 1732#L510-4 call strcspn_#t~mem8 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1715#L510-1 assume !!(0 != strcspn_#t~mem8);havoc strcspn_#t~mem8;strcspn_~i~0 := 0; 1716#L511-4 [2019-11-28 02:59:56,893 INFO L796 eck$LassoCheckResult]: Loop: 1716#L511-4 call strcspn_#t~mem6 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1710#L511-1 assume !!(0 != strcspn_#t~mem6);havoc strcspn_#t~mem6;call strcspn_#t~mem4 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem5 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1711#L512 assume !(strcspn_#t~mem4 == strcspn_#t~mem5);havoc strcspn_#t~mem4;havoc strcspn_#t~mem5; 1720#L511-3 strcspn_#t~pre3 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre3; 1716#L511-4 [2019-11-28 02:59:56,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:56,894 INFO L82 PathProgramCache]: Analyzing trace with hash -43865248, now seen corresponding path program 6 times [2019-11-28 02:59:56,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:56,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52344508] [2019-11-28 02:59:56,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:56,947 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:56,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:56,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 5 times [2019-11-28 02:59:56,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:56,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425287819] [2019-11-28 02:59:56,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:56,955 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:56,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:56,955 INFO L82 PathProgramCache]: Analyzing trace with hash -345387609, now seen corresponding path program 7 times [2019-11-28 02:59:56,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:56,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193031089] [2019-11-28 02:59:56,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:57,017 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:58,321 WARN L192 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 263 DAG size of output: 200 [2019-11-28 02:59:58,529 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-28 02:59:58,532 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:58,533 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:58,533 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:58,533 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:58,533 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:58,533 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:58,533 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:58,533 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:58,533 INFO L133 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration7_Lasso [2019-11-28 02:59:58,533 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:58,534 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:58,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:58,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:58,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:58,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:58,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:58,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:58,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:58,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:58,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:58,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:58,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:59,237 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2019-11-28 02:59:59,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:59,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:59,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:59,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:59,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:59,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:59,672 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-28 03:00:10,346 WARN L192 SmtUtils]: Spent 10.63 s on a formula simplification. DAG size of input: 298 DAG size of output: 150 [2019-11-28 03:00:10,591 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:00:10,592 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:10,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:10,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:10,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:10,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:10,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:10,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:10,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:10,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:10,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:10,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:10,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:10,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:10,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:10,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:10,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:10,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:10,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:10,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:10,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:10,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:10,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:10,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:10,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:10,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:10,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:10,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:10,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:10,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:10,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:10,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:10,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:10,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:10,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:10,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:10,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:10,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:10,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:10,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:10,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:10,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:10,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:10,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:10,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:10,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:10,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:10,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:10,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:10,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:10,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:10,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:10,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:10,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:10,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:10,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:10,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:10,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:10,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:10,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:10,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:10,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:10,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:10,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:10,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:10,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:10,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:10,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:10,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:10,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:10,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:10,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:10,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:10,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:10,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:10,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:10,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:10,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:10,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:10,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:10,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:10,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:10,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:10,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:10,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:10,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:10,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:10,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:10,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:10,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:10,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:10,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:10,705 INFO L203 nArgumentSynthesizer]: 108 stem disjuncts [2019-11-28 03:00:10,705 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2019-11-28 03:00:10,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:11,077 INFO L401 nArgumentSynthesizer]: We have 904 Motzkin's Theorem applications. [2019-11-28 03:00:11,078 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-11-28 03:00:12,125 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:12,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:12,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:12,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:12,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:12,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:12,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:12,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:12,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:12,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:12,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:12,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:12,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:12,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:12,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:12,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:12,186 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:00:12,225 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-28 03:00:12,225 INFO L444 ModelExtractionUtils]: 23 out of 49 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:12,229 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:00:12,231 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:00:12,231 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:00:12,232 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_5) = -1*ULTIMATE.start_strcspn_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_5 Supporting invariants [1*ULTIMATE.start_strcspn_~reject.offset >= 0] [2019-11-28 03:00:12,392 INFO L297 tatePredicateManager]: 37 out of 39 supporting invariants were superfluous and have been removed [2019-11-28 03:00:12,397 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:00:12,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:12,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:00:12,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:00:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:12,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:00:12,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:00:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:12,511 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-11-28 03:00:12,511 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10 Second operand 6 states. [2019-11-28 03:00:12,560 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10. Second operand 6 states. Result 55 states and 61 transitions. Complement of second has 6 states. [2019-11-28 03:00:12,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:00:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:00:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-28 03:00:12,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 36 letters. Loop has 4 letters. [2019-11-28 03:00:12,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:12,563 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:00:12,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:12,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:00:12,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:00:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:12,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:00:12,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:00:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:12,684 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2019-11-28 03:00:12,684 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10 Second operand 6 states. [2019-11-28 03:00:12,725 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10. Second operand 6 states. Result 55 states and 61 transitions. Complement of second has 6 states. [2019-11-28 03:00:12,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:00:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:00:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-28 03:00:12,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 36 letters. Loop has 4 letters. [2019-11-28 03:00:12,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:12,727 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:00:12,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:12,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:00:12,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:00:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:12,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:00:12,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:00:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:12,834 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-11-28 03:00:12,834 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10 Second operand 6 states. [2019-11-28 03:00:12,909 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10. Second operand 6 states. Result 108 states and 114 transitions. Complement of second has 8 states. [2019-11-28 03:00:12,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:00:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:00:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-11-28 03:00:12,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 36 letters. Loop has 4 letters. [2019-11-28 03:00:12,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:12,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 40 letters. Loop has 4 letters. [2019-11-28 03:00:12,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:12,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 36 letters. Loop has 8 letters. [2019-11-28 03:00:12,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:12,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 114 transitions. [2019-11-28 03:00:12,916 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:00:12,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 0 states and 0 transitions. [2019-11-28 03:00:12,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:00:12,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:00:12,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:00:12,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:12,917 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:00:12,917 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:00:12,917 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:00:12,917 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:00:12,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:00:12,918 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:00:12,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:00:12,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:00:12 BoogieIcfgContainer [2019-11-28 03:00:12,925 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:00:12,925 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:00:12,925 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:00:12,926 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:00:12,926 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:59:40" (3/4) ... [2019-11-28 03:00:12,930 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:00:12,930 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:00:12,931 INFO L168 Benchmark]: Toolchain (without parser) took 33391.00 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 533.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 379.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:12,932 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:00:12,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 679.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:12,932 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:00:12,933 INFO L168 Benchmark]: Boogie Preprocessor took 65.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:12,933 INFO L168 Benchmark]: RCFGBuilder took 399.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:12,934 INFO L168 Benchmark]: BuchiAutomizer took 32161.73 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 396.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -19.0 MB). Peak memory consumption was 377.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:12,934 INFO L168 Benchmark]: Witness Printer took 4.49 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 03:00:12,937 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 679.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 399.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 32161.73 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 396.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -19.0 MB). Peak memory consumption was 377.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.49 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 - 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 7 terminating modules (2 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 4 locations. One nondeterministic module has affine ranking function -2 * i + 3 * unknown-#length-unknown[reject] and consists of 8 locations. One nondeterministic module has affine ranking function -2 * i + 5 * unknown-#length-unknown[reject] and consists of 9 locations. One nondeterministic module has affine ranking function -1 * i + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 32.1s and 8 iterations. TraceHistogramMax:6. Analysis of lassos took 29.2s. Construction of modules took 0.3s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 141 SDtfs, 350 SDslu, 192 SDs, 0 SdLazy, 228 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital264 mio100 ax100 hnf99 lsp95 ukn76 mio100 lsp38 div100 bol100 ite100 ukn100 eq185 hnf87 smp98 dnf1781 smp67 tf100 neg89 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 1424ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 108 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 904 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...