./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/cstrspn.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-crafted-lit/cstrspn.c -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 0c74f0cc26425c1a044a70e86941b5dd82b132ff ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:34:43,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:34:43,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:34:43,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:34:43,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:34:43,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:34:43,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:34:43,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:34:43,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:34:43,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:34:43,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:34:43,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:34:43,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:34:43,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:34:43,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:34:43,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:34:43,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:34:43,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:34:43,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:34:43,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:34:43,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:34:43,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:34:43,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:34:43,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:34:43,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:34:43,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:34:43,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:34:43,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:34:43,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:34:43,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:34:43,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:34:43,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:34:43,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:34:43,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:34:43,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:34:43,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:34:43,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:34:43,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:34:43,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:34:43,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:34:43,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:34:43,274 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:34:43,322 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:34:43,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:34:43,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:34:43,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:34:43,325 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:34:43,325 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:34:43,325 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:34:43,326 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:34:43,326 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:34:43,326 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:34:43,327 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:34:43,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:34:43,328 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:34:43,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:34:43,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:34:43,329 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:34:43,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:34:43,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:34:43,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:34:43,330 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:34:43,331 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:34:43,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:34:43,331 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:34:43,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:34:43,332 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:34:43,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:34:43,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:34:43,332 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:34:43,333 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:34:43,334 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:34:43,334 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 -> 0c74f0cc26425c1a044a70e86941b5dd82b132ff [2020-10-20 06:34:43,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:34:43,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:34:43,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:34:43,566 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:34:43,567 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:34:43,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/cstrspn.c [2020-10-20 06:34:43,641 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05ff561fa/94372e3f26aa4ff690fa97c6f3fee448/FLAG296dd33da [2020-10-20 06:34:44,200 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:34:44,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/cstrspn.c [2020-10-20 06:34:44,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05ff561fa/94372e3f26aa4ff690fa97c6f3fee448/FLAG296dd33da [2020-10-20 06:34:44,546 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05ff561fa/94372e3f26aa4ff690fa97c6f3fee448 [2020-10-20 06:34:44,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:34:44,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:34:44,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:34:44,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:34:44,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:34:44,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:34:44" (1/1) ... [2020-10-20 06:34:44,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d0a8f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:34:44, skipping insertion in model container [2020-10-20 06:34:44,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:34:44" (1/1) ... [2020-10-20 06:34:44,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:34:44,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:34:44,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:34:44,847 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:34:44,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:34:44,881 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:34:44,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:34:44 WrapperNode [2020-10-20 06:34:44,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:34:44,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:34:44,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:34:44,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:34:44,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:34:44" (1/1) ... [2020-10-20 06:34:44,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:34:44" (1/1) ... [2020-10-20 06:34:44,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:34:44,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:34:44,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:34:44,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:34:44,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:34:44" (1/1) ... [2020-10-20 06:34:44,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:34:44" (1/1) ... [2020-10-20 06:34:44,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:34:44" (1/1) ... [2020-10-20 06:34:44,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:34:44" (1/1) ... [2020-10-20 06:34:44,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:34:44" (1/1) ... [2020-10-20 06:34:44,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:34:44" (1/1) ... [2020-10-20 06:34:44,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:34:44" (1/1) ... [2020-10-20 06:34:44,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:34:44,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:34:44,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:34:44,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:34:44,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:34:44" (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 [2020-10-20 06:34:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:34:45,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 06:34:45,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:34:45,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:34:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:34:45,349 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:34:45,349 INFO L298 CfgBuilder]: Removed 12 assume(true) statements. [2020-10-20 06:34:45,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:34:45 BoogieIcfgContainer [2020-10-20 06:34:45,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:34:45,353 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:34:45,353 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:34:45,358 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:34:45,359 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:34:45,360 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:34:44" (1/3) ... [2020-10-20 06:34:45,361 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5666e6ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:34:45, skipping insertion in model container [2020-10-20 06:34:45,361 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:34:45,362 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:34:44" (2/3) ... [2020-10-20 06:34:45,362 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5666e6ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:34:45, skipping insertion in model container [2020-10-20 06:34:45,362 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:34:45,363 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:34:45" (3/3) ... [2020-10-20 06:34:45,365 INFO L373 chiAutomizerObserver]: Analyzing ICFG cstrspn.c [2020-10-20 06:34:45,422 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:34:45,423 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:34:45,423 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:34:45,423 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:34:45,424 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:34:45,424 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:34:45,424 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:34:45,424 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:34:45,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-10-20 06:34:45,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:34:45,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:34:45,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:34:45,493 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:34:45,494 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:34:45,494 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:34:45,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-10-20 06:34:45,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:34:45,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:34:45,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:34:45,497 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:34:45,498 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:34:45,504 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13#L-1true havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 22#L14true assume !(build_nondet_String_~length~0 < 1); 19#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 10#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 16#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 12#L14-5true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 8#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 4#L31-4true [2020-10-20 06:34:45,505 INFO L796 eck$LassoCheckResult]: Loop: 4#L31-4true call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 11#L31-1true assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 9#L34-5true assume !true; 5#L34-6true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 23#L36true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 6#L31-3true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 4#L31-4true [2020-10-20 06:34:45,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:45,510 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2020-10-20 06:34:45,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:34:45,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296485409] [2020-10-20 06:34:45,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:34:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:45,640 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:45,673 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:45,699 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:34:45,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:45,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2020-10-20 06:34:45,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:34:45,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578273432] [2020-10-20 06:34:45,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:34:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:34:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:34:45,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578273432] [2020-10-20 06:34:45,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:34:45,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:34:45,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377835815] [2020-10-20 06:34:45,762 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:34:45,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:34:45,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 06:34:45,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 06:34:45,781 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2020-10-20 06:34:45,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:34:45,787 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2020-10-20 06:34:45,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 06:34:45,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2020-10-20 06:34:45,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:34:45,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2020-10-20 06:34:45,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 06:34:45,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-20 06:34:45,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2020-10-20 06:34:45,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:34:45,807 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-10-20 06:34:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2020-10-20 06:34:45,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-10-20 06:34:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-20 06:34:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-10-20 06:34:45,833 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-10-20 06:34:45,833 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-10-20 06:34:45,833 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:34:45,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-10-20 06:34:45,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:34:45,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:34:45,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:34:45,835 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:34:45,835 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:34:45,836 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 62#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 63#L14 assume !(build_nondet_String_~length~0 < 1); 65#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 58#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 59#L14-3 assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 60#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 55#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 50#L31-4 [2020-10-20 06:34:45,836 INFO L796 eck$LassoCheckResult]: Loop: 50#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 51#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 56#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 57#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 61#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6; 52#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 53#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 54#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 50#L31-4 [2020-10-20 06:34:45,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:45,836 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2020-10-20 06:34:45,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:34:45,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237265834] [2020-10-20 06:34:45,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:34:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:45,859 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:45,881 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:45,893 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:34:45,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:45,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2020-10-20 06:34:45,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:34:45,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269213013] [2020-10-20 06:34:45,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:34:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:45,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:45,924 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:45,928 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:34:45,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:45,929 INFO L82 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2020-10-20 06:34:45,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:34:45,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816864694] [2020-10-20 06:34:45,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:34:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:34:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:34:46,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816864694] [2020-10-20 06:34:46,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:34:46,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 06:34:46,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914145032] [2020-10-20 06:34:46,354 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-10-20 06:34:46,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:34:46,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:34:46,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:34:46,442 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2020-10-20 06:34:46,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:34:46,625 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-10-20 06:34:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:34:46,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2020-10-20 06:34:46,628 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-10-20 06:34:46,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2020-10-20 06:34:46,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-10-20 06:34:46,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-10-20 06:34:46,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2020-10-20 06:34:46,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:34:46,631 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-10-20 06:34:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2020-10-20 06:34:46,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2020-10-20 06:34:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 06:34:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-10-20 06:34:46,636 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-10-20 06:34:46,636 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-10-20 06:34:46,636 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:34:46,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2020-10-20 06:34:46,638 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-10-20 06:34:46,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:34:46,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:34:46,639 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:34:46,639 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:34:46,640 INFO L794 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 131#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 132#L14 assume !(build_nondet_String_~length~0 < 1); 137#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 126#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 127#L14-3 assume !(build_nondet_String_~length~0 < 1); 129#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 130#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 142#L31-4 [2020-10-20 06:34:46,640 INFO L796 eck$LassoCheckResult]: Loop: 142#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 141#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 124#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 125#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 138#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6; 139#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 144#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 143#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 142#L31-4 [2020-10-20 06:34:46,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:46,658 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2020-10-20 06:34:46,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:34:46,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515065224] [2020-10-20 06:34:46,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:34:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:46,673 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:46,690 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:46,695 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:34:46,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:46,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2020-10-20 06:34:46,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:34:46,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454668279] [2020-10-20 06:34:46,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:34:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:46,706 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:46,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:46,718 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:34:46,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:46,719 INFO L82 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2020-10-20 06:34:46,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:34:46,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042145617] [2020-10-20 06:34:46,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:34:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:46,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:46,774 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:46,780 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:34:46,981 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-10-20 06:34:47,509 WARN L193 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 108 [2020-10-20 06:34:47,679 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-20 06:34:47,693 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:34:47,694 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:34:47,694 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:34:47,694 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:34:47,695 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:34:47,695 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:34:47,695 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:34:47,695 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:34:47,695 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration3_Lasso [2020-10-20 06:34:47,696 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:34:47,696 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:34:47,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,050 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2020-10-20 06:34:48,217 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-10-20 06:34:48,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:48,719 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2020-10-20 06:34:49,196 WARN L193 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2020-10-20 06:34:49,305 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:34:49,311 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) [2020-10-20 06:34:49,324 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 [2020-10-20 06:34:49,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:49,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:49,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:49,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:34:49,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:34:49,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:34:49,361 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:34:49,440 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-10-20 06:34:49,441 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. 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 [2020-10-20 06:34:49,448 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:34:49,496 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:34:49,497 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:34:49,498 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1, ULTIMATE.start_cstrspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0.offset Supporting invariants [] [2020-10-20 06:34:49,565 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-10-20 06:34:49,576 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:34:49,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:34:49,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:34:49,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:34:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:34:49,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:34:49,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:34:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:34:49,709 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 [2020-10-20 06:34:49,711 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-10-20 06:34:49,766 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2020-10-20 06:34:49,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:34:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:34:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2020-10-20 06:34:49,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2020-10-20 06:34:49,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:34:49,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2020-10-20 06:34:49,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:34:49,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2020-10-20 06:34:49,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:34:49,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2020-10-20 06:34:49,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:34:49,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2020-10-20 06:34:49,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-20 06:34:49,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 06:34:49,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2020-10-20 06:34:49,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:34:49,776 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-20 06:34:49,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2020-10-20 06:34:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-10-20 06:34:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-20 06:34:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-10-20 06:34:49,778 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-20 06:34:49,778 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-20 06:34:49,778 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:34:49,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-10-20 06:34:49,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:34:49,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:34:49,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:34:49,780 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:34:49,780 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:34:49,780 INFO L794 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 302#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 303#L14 assume !(build_nondet_String_~length~0 < 1); 306#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 297#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 298#L14-3 assume !(build_nondet_String_~length~0 < 1); 299#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 292#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 285#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 287#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 293#L34-5 [2020-10-20 06:34:49,781 INFO L796 eck$LassoCheckResult]: Loop: 293#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 294#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 300#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 293#L34-5 [2020-10-20 06:34:49,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:49,781 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2020-10-20 06:34:49,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:34:49,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69325424] [2020-10-20 06:34:49,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:34:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:49,797 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:49,809 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:49,814 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:34:49,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:49,814 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2020-10-20 06:34:49,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:34:49,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742057908] [2020-10-20 06:34:49,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:34:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:49,820 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:49,825 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:49,827 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:34:49,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:49,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2020-10-20 06:34:49,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:34:49,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199217767] [2020-10-20 06:34:49,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:34:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:49,847 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:49,864 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:49,869 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:34:50,511 WARN L193 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 122 [2020-10-20 06:34:50,683 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-20 06:34:50,685 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:34:50,685 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:34:50,685 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:34:50,685 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:34:50,686 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:34:50,686 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:34:50,686 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:34:50,686 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:34:50,686 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration4_Lasso [2020-10-20 06:34:50,686 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:34:50,686 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:34:50,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:50,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:50,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:50,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:50,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:50,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:50,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:50,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:50,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:50,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:50,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:50,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:51,029 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2020-10-20 06:34:51,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:51,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:51,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:51,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:51,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:51,433 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2020-10-20 06:34:52,069 WARN L193 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2020-10-20 06:34:52,405 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-10-20 06:34:52,421 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:34:52,421 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:34:52,426 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 [2020-10-20 06:34:52,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:52,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:34:52,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:52,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:52,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:34:52,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:34:52,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:34:52,431 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:34:52,455 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 [2020-10-20 06:34:52,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:52,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:34:52,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:52,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:52,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:34:52,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:34:52,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:34:52,460 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:34:52,489 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 [2020-10-20 06:34:52,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:52,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:34:52,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:52,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:52,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:34:52,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:34:52,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:34:52,494 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 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 [2020-10-20 06:34:52,516 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 [2020-10-20 06:34:52,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:52,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:34:52,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:52,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:52,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:34:52,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:34:52,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:34:52,527 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 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:34:52,561 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 [2020-10-20 06:34:52,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:52,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:34:52,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:52,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:52,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:34:52,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:34:52,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:34:52,566 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 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:34:52,593 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 [2020-10-20 06:34:52,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:52,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:52,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:52,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:34:52,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:34:52,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:34:52,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 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 [2020-10-20 06:34:52,640 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 [2020-10-20 06:34:52,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:52,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:34:52,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:52,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:52,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:34:52,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:34:52,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:34:52,645 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:34:52,670 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 [2020-10-20 06:34:52,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:52,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:34:52,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:52,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:52,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:34:52,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:34:52,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:34:52,673 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 [2020-10-20 06:34:52,699 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 [2020-10-20 06:34:52,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:52,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:34:52,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:52,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:52,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:34:52,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:34:52,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:34:52,703 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 [2020-10-20 06:34:52,726 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 [2020-10-20 06:34:52,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:52,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:34:52,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:52,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:52,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:34:52,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:34:52,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:34:52,730 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:34:52,766 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 [2020-10-20 06:34:52,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:52,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:34:52,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:52,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:52,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:34:52,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:34:52,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:34:52,770 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 [2020-10-20 06:34:52,791 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 [2020-10-20 06:34:52,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:52,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:52,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:52,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:34:52,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:34:52,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:34:52,799 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) [2020-10-20 06:34:52,822 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 [2020-10-20 06:34:52,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:52,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:52,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:52,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:34:52,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:34:52,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:34:52,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2020-10-20 06:34:52,880 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 [2020-10-20 06:34:52,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:52,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:52,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:52,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:34:52,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:34:52,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:34:52,887 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 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 [2020-10-20 06:34:52,912 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 [2020-10-20 06:34:52,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:52,913 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-10-20 06:34:52,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:52,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:34:52,937 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-10-20 06:34:52,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:34:52,960 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:34:52,983 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:34:52,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:52,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:52,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:52,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:34:52,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:34:52,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:34:52,991 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 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 [2020-10-20 06:34:53,022 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 [2020-10-20 06:34:53,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:34:53,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:34:53,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:34:53,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:34:53,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:34:53,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:34:53,065 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:34:53,153 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-10-20 06:34:53,153 INFO L444 ModelExtractionUtils]: 14 out of 49 variables were initially zero. Simplification set additionally 32 variables to zero. 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 [2020-10-20 06:34:53,156 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:34:53,158 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:34:53,159 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:34:53,159 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2020-10-20 06:34:53,220 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2020-10-20 06:34:53,223 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:34:53,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:34:53,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 06:34:53,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:34:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:34:53,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:34:53,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:34:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:34:53,391 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-10-20 06:34:53,391 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-10-20 06:34:53,461 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 49 states and 59 transitions. Complement of second has 7 states. [2020-10-20 06:34:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:34:53,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:34:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-10-20 06:34:53,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2020-10-20 06:34:53,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:34:53,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2020-10-20 06:34:53,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:34:53,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2020-10-20 06:34:53,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:34:53,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2020-10-20 06:34:53,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:34:53,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 42 transitions. [2020-10-20 06:34:53,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 06:34:53,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 06:34:53,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2020-10-20 06:34:53,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:34:53,466 INFO L691 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-20 06:34:53,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2020-10-20 06:34:53,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2020-10-20 06:34:53,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 06:34:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-10-20 06:34:53,470 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-10-20 06:34:53,470 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-10-20 06:34:53,470 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:34:53,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2020-10-20 06:34:53,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:34:53,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:34:53,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:34:53,471 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:34:53,471 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:34:53,472 INFO L794 eck$LassoCheckResult]: Stem: 485#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 483#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 484#L14 assume !(build_nondet_String_~length~0 < 1); 487#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 477#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 478#L14-3 assume !(build_nondet_String_~length~0 < 1); 480#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 472#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 464#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 465#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 479#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 486#L34-1 assume !cstrspn_#t~short7; 482#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6; 469#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 470#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 471#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 466#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 468#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 473#L34-5 [2020-10-20 06:34:53,472 INFO L796 eck$LassoCheckResult]: Loop: 473#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 474#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 481#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 473#L34-5 [2020-10-20 06:34:53,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:53,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2020-10-20 06:34:53,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:34:53,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463277512] [2020-10-20 06:34:53,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:34:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:34:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:34:53,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463277512] [2020-10-20 06:34:53,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:34:53,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 06:34:53,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908056269] [2020-10-20 06:34:53,522 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:34:53,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:53,522 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2020-10-20 06:34:53,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:34:53,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798504432] [2020-10-20 06:34:53,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:34:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:53,527 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:53,530 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:53,532 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:34:53,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:34:53,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:34:53,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:34:53,627 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-10-20 06:34:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:34:53,716 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-10-20 06:34:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:34:53,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2020-10-20 06:34:53,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:34:53,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 31 transitions. [2020-10-20 06:34:53,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 06:34:53,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 06:34:53,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2020-10-20 06:34:53,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:34:53,719 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-10-20 06:34:53,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2020-10-20 06:34:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-10-20 06:34:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 06:34:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-10-20 06:34:53,722 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-10-20 06:34:53,722 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-10-20 06:34:53,722 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:34:53,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2020-10-20 06:34:53,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:34:53,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:34:53,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:34:53,723 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:34:53,723 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:34:53,724 INFO L794 eck$LassoCheckResult]: Stem: 560#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 558#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 559#L14 assume !(build_nondet_String_~length~0 < 1); 563#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 552#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 553#L14-3 assume !(build_nondet_String_~length~0 < 1); 554#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 547#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 539#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 540#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 557#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 561#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 562#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6; 544#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 545#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 546#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 541#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 543#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 548#L34-5 [2020-10-20 06:34:53,724 INFO L796 eck$LassoCheckResult]: Loop: 548#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 549#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 555#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 548#L34-5 [2020-10-20 06:34:53,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:53,724 INFO L82 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2020-10-20 06:34:53,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:34:53,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953655966] [2020-10-20 06:34:53,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:34:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:53,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:53,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:53,766 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:34:53,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:53,766 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2020-10-20 06:34:53,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:34:53,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938579244] [2020-10-20 06:34:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:34:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:53,771 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:53,774 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:53,776 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:34:53,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:34:53,785 INFO L82 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2020-10-20 06:34:53,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:34:53,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49057731] [2020-10-20 06:34:53,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:34:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:53,803 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:34:53,820 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:34:53,825 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:34:54,731 WARN L193 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 160 [2020-10-20 06:34:56,365 WARN L193 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 130 DAG size of output: 130 [2020-10-20 06:34:56,369 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:34:56,370 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:34:56,370 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:34:56,370 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:34:56,370 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:34:56,370 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:34:56,370 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:34:56,371 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:34:56,371 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration6_Lasso [2020-10-20 06:34:56,371 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:34:56,371 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:34:56,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:56,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:56,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:56,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:56,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:56,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:56,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:56,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:56,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:56,708 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2020-10-20 06:34:57,667 WARN L193 SmtUtils]: Spent 945.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 105 [2020-10-20 06:34:57,808 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2020-10-20 06:34:57,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:57,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:57,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:57,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:57,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:57,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:57,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:57,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:34:58,345 WARN L193 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 103 [2020-10-20 06:34:58,543 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-10-20 06:35:00,271 WARN L193 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 116 DAG size of output: 91 [2020-10-20 06:35:00,955 WARN L193 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2020-10-20 06:35:01,512 WARN L193 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2020-10-20 06:35:01,578 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:35:01,579 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2020-10-20 06:35:01,582 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 [2020-10-20 06:35:01,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:01,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:01,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:01,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:01,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:01,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:35:01,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:01,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 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 [2020-10-20 06:35:01,619 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 [2020-10-20 06:35:01,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:01,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:01,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:01,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:01,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:35:01,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:35:01,626 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 [2020-10-20 06:35:01,648 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 [2020-10-20 06:35:01,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:01,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:01,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:01,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:01,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:01,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:35:01,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:01,651 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 [2020-10-20 06:35:01,675 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 [2020-10-20 06:35:01,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:01,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:01,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:01,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:01,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:01,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:35:01,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:01,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 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 [2020-10-20 06:35:01,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 [2020-10-20 06:35:01,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:01,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:01,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:01,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:01,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:01,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:35:01,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:01,706 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 [2020-10-20 06:35:01,728 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 [2020-10-20 06:35:01,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:01,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:01,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:01,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:01,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:01,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:35:01,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:01,732 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) [2020-10-20 06:35:01,756 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:01,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:01,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:01,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:01,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:01,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:35:01,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:35:01,764 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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:01,793 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 [2020-10-20 06:35:01,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:01,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:35:01,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:01,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:01,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:01,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:35:01,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:35:01,798 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 [2020-10-20 06:35:01,826 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 [2020-10-20 06:35:01,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:01,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:35:01,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:35:01,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:01,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:35:01,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:35:01,832 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) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:35:01,855 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 [2020-10-20 06:35:01,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:35:01,857 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-10-20 06:35:01,857 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2020-10-20 06:35:01,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:35:02,159 INFO L401 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2020-10-20 06:35:02,159 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2020-10-20 06:35:03,540 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:35:05,269 INFO L443 ModelExtractionUtils]: Simplification made 47 calls to the SMT solver. [2020-10-20 06:35:05,270 INFO L444 ModelExtractionUtils]: 128 out of 274 variables were initially zero. Simplification set additionally 143 variables to zero. 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 [2020-10-20 06:35:05,273 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:35:05,284 INFO L438 nArgumentSynthesizer]: Removed 12 redundant supporting invariants from a total of 12. [2020-10-20 06:35:05,284 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:35:05,285 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3 Supporting invariants [] [2020-10-20 06:35:05,459 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2020-10-20 06:35:05,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:35:05,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:05,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:35:05,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:05,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:35:05,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:05,527 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 [2020-10-20 06:35:05,527 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-10-20 06:35:05,554 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 43 states and 48 transitions. Complement of second has 5 states. [2020-10-20 06:35:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:35:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:35:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2020-10-20 06:35:05,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2020-10-20 06:35:05,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:05,556 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:35:05,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:05,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:35:05,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:05,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:35:05,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:05,625 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:35:05,625 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-10-20 06:35:05,650 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 43 states and 48 transitions. Complement of second has 5 states. [2020-10-20 06:35:05,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:35:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:35:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2020-10-20 06:35:05,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2020-10-20 06:35:05,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:05,653 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:35:05,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:35:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:05,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:35:05,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:35:05,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:35:05,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:35:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:35:05,725 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:35:05,725 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-10-20 06:35:05,754 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 42 states and 48 transitions. Complement of second has 4 states. [2020-10-20 06:35:05,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:35:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:35:05,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2020-10-20 06:35:05,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2020-10-20 06:35:05,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:05,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 21 letters. Loop has 3 letters. [2020-10-20 06:35:05,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:05,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 6 letters. [2020-10-20 06:35:05,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:35:05,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2020-10-20 06:35:05,764 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:35:05,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2020-10-20 06:35:05,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 06:35:05,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 06:35:05,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 06:35:05,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:35:05,765 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:35:05,766 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:35:05,766 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:35:05,766 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:35:05,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 06:35:05,766 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:35:05,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 06:35:05,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:35:05 BoogieIcfgContainer [2020-10-20 06:35:05,773 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:35:05,774 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:35:05,774 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:35:05,774 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:35:05,775 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:34:45" (3/4) ... [2020-10-20 06:35:05,778 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 06:35:05,778 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:35:05,779 INFO L168 Benchmark]: Toolchain (without parser) took 21228.39 ms. Allocated memory was 40.9 MB in the beginning and 117.4 MB in the end (delta: 76.5 MB). Free memory was 19.4 MB in the beginning and 21.1 MB in the end (delta: -1.7 MB). Peak memory consumption was 74.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:35:05,780 INFO L168 Benchmark]: CDTParser took 1.35 ms. Allocated memory is still 31.5 MB. Free memory was 7.6 MB in the beginning and 7.6 MB in the end (delta: 44.0 kB). Peak memory consumption was 44.0 kB. Max. memory is 14.3 GB. [2020-10-20 06:35:05,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.14 ms. Allocated memory was 40.9 MB in the beginning and 41.9 MB in the end (delta: 1.0 MB). Free memory was 18.6 MB in the beginning and 18.9 MB in the end (delta: -246.4 kB). Peak memory consumption was 9.7 MB. Max. memory is 14.3 GB. [2020-10-20 06:35:05,781 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.15 ms. Allocated memory is still 41.9 MB. Free memory was 18.9 MB in the beginning and 17.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:35:05,782 INFO L168 Benchmark]: Boogie Preprocessor took 35.11 ms. Allocated memory is still 41.9 MB. Free memory was 17.0 MB in the beginning and 15.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. [2020-10-20 06:35:05,783 INFO L168 Benchmark]: RCFGBuilder took 392.89 ms. Allocated memory was 41.9 MB in the beginning and 44.0 MB in the end (delta: 2.1 MB). Free memory was 15.2 MB in the beginning and 14.8 MB in the end (delta: 342.7 kB). Peak memory consumption was 5.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:35:05,783 INFO L168 Benchmark]: BuchiAutomizer took 20420.34 ms. Allocated memory was 44.0 MB in the beginning and 117.4 MB in the end (delta: 73.4 MB). Free memory was 14.8 MB in the beginning and 22.7 MB in the end (delta: -7.9 MB). Peak memory consumption was 65.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:35:05,784 INFO L168 Benchmark]: Witness Printer took 4.14 ms. Allocated memory is still 117.4 MB. Free memory was 22.7 MB in the beginning and 21.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:35:05,788 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.35 ms. Allocated memory is still 31.5 MB. Free memory was 7.6 MB in the beginning and 7.6 MB in the end (delta: 44.0 kB). Peak memory consumption was 44.0 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 322.14 ms. Allocated memory was 40.9 MB in the beginning and 41.9 MB in the end (delta: 1.0 MB). Free memory was 18.6 MB in the beginning and 18.9 MB in the end (delta: -246.4 kB). Peak memory consumption was 9.7 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 41.15 ms. Allocated memory is still 41.9 MB. Free memory was 18.9 MB in the beginning and 17.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 35.11 ms. Allocated memory is still 41.9 MB. Free memory was 17.0 MB in the beginning and 15.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 392.89 ms. Allocated memory was 41.9 MB in the beginning and 44.0 MB in the end (delta: 2.1 MB). Free memory was 15.2 MB in the beginning and 14.8 MB in the end (delta: 342.7 kB). Peak memory consumption was 5.3 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 20420.34 ms. Allocated memory was 44.0 MB in the beginning and 117.4 MB in the end (delta: 73.4 MB). Free memory was 14.8 MB in the beginning and 22.7 MB in the end (delta: -7.9 MB). Peak memory consumption was 65.6 MB. Max. memory is 14.3 GB. * Witness Printer took 4.14 ms. Allocated memory is still 117.4 MB. Free memory was 22.7 MB in the beginning and 21.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[sc1] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 5 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 19.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 138 SDtfs, 159 SDslu, 119 SDs, 0 SdLazy, 174 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital349 mio100 ax100 hnf99 lsp137 ukn58 mio100 lsp51 div113 bol100 ite100 ukn100 eq169 hnf87 smp85 dnf841 smp44 tf100 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 3431ms VariablesStem: 24 VariablesLoop: 12 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...