./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash b05f810cf5c3fdbb476cd22f2154f4cd5a41b63d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 20:26:13,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 20:26:13,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 20:26:13,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 20:26:13,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 20:26:13,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 20:26:13,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 20:26:13,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 20:26:13,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 20:26:13,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 20:26:13,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 20:26:13,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 20:26:13,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 20:26:13,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 20:26:13,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 20:26:13,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 20:26:13,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 20:26:13,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 20:26:13,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 20:26:13,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 20:26:13,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 20:26:13,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 20:26:13,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 20:26:13,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 20:26:13,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 20:26:13,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 20:26:13,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 20:26:13,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 20:26:13,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 20:26:13,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 20:26:13,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 20:26:13,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 20:26:13,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 20:26:13,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 20:26:13,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 20:26:13,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 20:26:13,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 20:26:13,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 20:26:13,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 20:26:13,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 20:26:13,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 20:26:13,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 20:26:13,271 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 20:26:13,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 20:26:13,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 20:26:13,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 20:26:13,273 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 20:26:13,274 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 20:26:13,274 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 20:26:13,274 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 20:26:13,275 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 20:26:13,275 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 20:26:13,275 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 20:26:13,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 20:26:13,276 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 20:26:13,276 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 20:26:13,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 20:26:13,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 20:26:13,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 20:26:13,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 20:26:13,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 20:26:13,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 20:26:13,278 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 20:26:13,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 20:26:13,278 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 20:26:13,279 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 20:26:13,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 20:26:13,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 20:26:13,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 20:26:13,280 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 20:26:13,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 20:26:13,280 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 20:26:13,281 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 20:26:13,281 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 20:26:13,282 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 20:26:13,282 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b05f810cf5c3fdbb476cd22f2154f4cd5a41b63d [2020-10-19 20:26:13,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 20:26:13,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 20:26:13,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 20:26:13,606 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 20:26:13,606 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 20:26:13,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i [2020-10-19 20:26:13,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6032c4d70/725bf87b63e24692b8352ae526367bcb/FLAGafeb6e618 [2020-10-19 20:26:14,170 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 20:26:14,171 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i [2020-10-19 20:26:14,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6032c4d70/725bf87b63e24692b8352ae526367bcb/FLAGafeb6e618 [2020-10-19 20:26:14,500 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6032c4d70/725bf87b63e24692b8352ae526367bcb [2020-10-19 20:26:14,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 20:26:14,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 20:26:14,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 20:26:14,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 20:26:14,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 20:26:14,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:26:14" (1/1) ... [2020-10-19 20:26:14,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ea562fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:14, skipping insertion in model container [2020-10-19 20:26:14,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:26:14" (1/1) ... [2020-10-19 20:26:14,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 20:26:14,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 20:26:14,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:26:14,956 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 20:26:15,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:26:15,059 INFO L208 MainTranslator]: Completed translation [2020-10-19 20:26:15,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:15 WrapperNode [2020-10-19 20:26:15,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 20:26:15,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 20:26:15,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 20:26:15,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 20:26:15,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:15" (1/1) ... [2020-10-19 20:26:15,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:15" (1/1) ... [2020-10-19 20:26:15,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 20:26:15,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 20:26:15,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 20:26:15,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 20:26:15,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:15" (1/1) ... [2020-10-19 20:26:15,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:15" (1/1) ... [2020-10-19 20:26:15,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:15" (1/1) ... [2020-10-19 20:26:15,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:15" (1/1) ... [2020-10-19 20:26:15,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:15" (1/1) ... [2020-10-19 20:26:15,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:15" (1/1) ... [2020-10-19 20:26:15,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:15" (1/1) ... [2020-10-19 20:26:15,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 20:26:15,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 20:26:15,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 20:26:15,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 20:26:15,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:15" (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-19 20:26:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 20:26:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 20:26:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 20:26:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 20:26:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 20:26:15,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 20:26:15,568 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 20:26:15,568 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-19 20:26:15,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:26:15 BoogieIcfgContainer [2020-10-19 20:26:15,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 20:26:15,571 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 20:26:15,572 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 20:26:15,575 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 20:26:15,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:26:15,577 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 08:26:14" (1/3) ... [2020-10-19 20:26:15,578 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45931203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:26:15, skipping insertion in model container [2020-10-19 20:26:15,579 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:26:15,579 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:26:15" (2/3) ... [2020-10-19 20:26:15,579 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45931203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:26:15, skipping insertion in model container [2020-10-19 20:26:15,580 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:26:15,580 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:26:15" (3/3) ... [2020-10-19 20:26:15,582 INFO L373 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca-2.i [2020-10-19 20:26:15,633 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 20:26:15,634 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 20:26:15,634 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 20:26:15,634 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 20:26:15,635 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 20:26:15,635 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 20:26:15,635 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 20:26:15,635 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 20:26:15,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-10-19 20:26:15,681 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-10-19 20:26:15,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:15,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:15,689 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 20:26:15,690 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:26:15,690 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 20:26:15,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-10-19 20:26:15,693 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-10-19 20:26:15,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:15,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:15,694 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 20:26:15,694 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:26:15,702 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 19#L528true assume !(main_~length1~0 < 1); 5#L528-2true assume !(main_~length2~0 < 1); 15#L531-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 9#L537-3true [2020-10-19 20:26:15,702 INFO L796 eck$LassoCheckResult]: Loop: 9#L537-3true assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 8#L537-2true main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 9#L537-3true [2020-10-19 20:26:15,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:15,709 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-10-19 20:26:15,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:15,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571166187] [2020-10-19 20:26:15,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:15,830 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:15,845 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:15,867 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:15,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:15,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2020-10-19 20:26:15,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:15,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905902289] [2020-10-19 20:26:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:15,880 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:15,887 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:15,890 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:15,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:15,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2020-10-19 20:26:15,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:15,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4377067] [2020-10-19 20:26:15,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:15,921 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:15,938 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:15,946 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:16,172 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-10-19 20:26:16,265 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:26:16,266 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:26:16,267 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:26:16,267 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:26:16,267 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:26:16,267 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:16,268 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:26:16,268 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:26:16,268 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration1_Lasso [2020-10-19 20:26:16,269 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:26:16,269 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:26:16,296 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-19 20:26:16,310 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-19 20:26:16,317 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-19 20:26:16,321 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-19 20:26:16,324 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-19 20:26:16,328 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-19 20:26:16,331 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-19 20:26:16,336 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-19 20:26:16,340 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-19 20:26:16,345 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-19 20:26:16,349 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-19 20:26:16,352 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-19 20:26:16,356 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-19 20:26:16,360 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-19 20:26:16,364 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-19 20:26:16,528 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-19 20:26:16,869 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:26:16,875 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:16,881 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-19 20:26:16,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:16,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:16,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:16,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:16,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:16,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:16,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:16,943 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:16,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:16,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:16,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:16,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:16,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:16,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:16,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:16,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:16,974 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-19 20:26:16,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:16,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:16,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:16,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:16,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:16,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:16,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:16,980 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-19 20:26:17,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:17,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:17,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:17,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:17,014 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-19 20:26:17,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:17,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:17,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:17,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:17,049 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) [2020-10-19 20:26:17,085 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-19 20:26:17,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:17,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:17,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:17,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-19 20:26:17,144 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-19 20:26:17,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:17,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:17,154 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-19 20:26:17,188 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-19 20:26:17,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:17,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:17,199 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) [2020-10-19 20:26:17,248 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-19 20:26:17,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:17,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:17,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:17,255 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) [2020-10-19 20:26:17,295 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-19 20:26:17,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:17,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:17,318 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) [2020-10-19 20:26:17,375 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-19 20:26:17,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:17,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:17,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:17,381 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) [2020-10-19 20:26:17,424 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:17,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:17,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:17,434 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-19 20:26:17,468 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-19 20:26:17,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:17,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:17,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:17,474 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-19 20:26:17,498 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-19 20:26:17,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:17,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:17,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:17,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:17,537 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-19 20:26:17,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:17,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:17,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:17,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:17,567 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-19 20:26:17,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:17,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:17,589 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-19 20:26:17,632 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-19 20:26:17,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:17,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:17,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:17,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:17,679 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-19 20:26:17,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:17,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:17,691 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-19 20:26:17,717 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-19 20:26:17,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:17,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:17,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 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-19 20:26:17,759 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-19 20:26:17,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:17,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:17,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:17,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:17,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:17,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:17,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:17,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:17,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:17,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:17,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:17,854 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:26:18,029 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-19 20:26:18,029 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. 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-19 20:26:18,062 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:26:18,074 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:26:18,074 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:26:18,075 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-19 20:26:18,128 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-10-19 20:26:18,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:18,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:26:18,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:18,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:26:18,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:18,209 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-19 20:26:18,227 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-19 20:26:18,229 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2020-10-19 20:26:18,289 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 51 states and 75 transitions. Complement of second has 7 states. [2020-10-19 20:26:18,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:26:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:26:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2020-10-19 20:26:18,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-19 20:26:18,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:18,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2020-10-19 20:26:18,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:18,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 4 letters. [2020-10-19 20:26:18,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:18,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 75 transitions. [2020-10-19 20:26:18,303 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:26:18,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 17 states and 23 transitions. [2020-10-19 20:26:18,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 20:26:18,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-19 20:26:18,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2020-10-19 20:26:18,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:26:18,312 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-19 20:26:18,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2020-10-19 20:26:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-10-19 20:26:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-19 20:26:18,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-10-19 20:26:18,343 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-19 20:26:18,343 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-19 20:26:18,343 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 20:26:18,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-10-19 20:26:18,344 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:26:18,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:18,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:18,345 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:18,345 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:26:18,346 INFO L794 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 156#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 157#L528 assume !(main_~length1~0 < 1); 148#L528-2 assume !(main_~length2~0 < 1); 149#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 153#L537-3 assume !(main_~i~0 < main_~length1~0); 154#L537-4 main_~i~1 := 0; 155#L541-3 [2020-10-19 20:26:18,346 INFO L796 eck$LassoCheckResult]: Loop: 155#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 160#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 155#L541-3 [2020-10-19 20:26:18,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:18,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2020-10-19 20:26:18,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:18,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238510240] [2020-10-19 20:26:18,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:18,406 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-19 20:26:18,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238510240] [2020-10-19 20:26:18,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:26:18,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:26:18,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540742543] [2020-10-19 20:26:18,411 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:26:18,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:18,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2020-10-19 20:26:18,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:18,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330511181] [2020-10-19 20:26:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:18,420 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:18,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:18,427 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:18,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:26:18,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:26:18,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:26:18,468 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-19 20:26:18,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:26:18,498 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-10-19 20:26:18,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:26:18,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2020-10-19 20:26:18,501 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:26:18,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2020-10-19 20:26:18,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-19 20:26:18,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-19 20:26:18,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2020-10-19 20:26:18,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:26:18,503 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-10-19 20:26:18,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2020-10-19 20:26:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-10-19 20:26:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-19 20:26:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2020-10-19 20:26:18,505 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-10-19 20:26:18,506 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-10-19 20:26:18,506 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 20:26:18,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2020-10-19 20:26:18,507 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-19 20:26:18,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:18,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:18,508 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:18,508 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:26:18,508 INFO L794 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 198#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 199#L528 assume !(main_~length1~0 < 1); 190#L528-2 assume !(main_~length2~0 < 1); 191#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 195#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 193#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 194#L537-3 assume !(main_~i~0 < main_~length1~0); 196#L537-4 main_~i~1 := 0; 197#L541-3 [2020-10-19 20:26:18,508 INFO L796 eck$LassoCheckResult]: Loop: 197#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 202#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 197#L541-3 [2020-10-19 20:26:18,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:18,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2020-10-19 20:26:18,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:18,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885671467] [2020-10-19 20:26:18,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:18,524 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:18,537 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:18,542 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:18,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:18,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2020-10-19 20:26:18,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:18,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6920960] [2020-10-19 20:26:18,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:18,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:18,554 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:18,556 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:18,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:18,557 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2020-10-19 20:26:18,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:18,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086845282] [2020-10-19 20:26:18,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:18,574 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:18,598 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:18,606 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:18,798 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2020-10-19 20:26:18,882 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:26:18,882 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:26:18,882 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:26:18,882 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:26:18,882 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:26:18,882 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:18,883 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:26:18,883 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:26:18,883 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration3_Lasso [2020-10-19 20:26:18,883 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:26:18,883 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:26:18,887 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-19 20:26:18,891 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-19 20:26:19,032 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2020-10-19 20:26:19,056 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-19 20:26:19,059 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-19 20:26:19,061 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-19 20:26:19,065 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-19 20:26:19,067 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-19 20:26:19,070 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-19 20:26:19,073 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-19 20:26:19,076 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-19 20:26:19,079 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-19 20:26:19,082 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-19 20:26:19,084 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-19 20:26:19,088 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-19 20:26:19,376 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:26:19,377 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-19 20:26:19,380 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-19 20:26:19,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:19,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:19,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:19,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:19,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:19,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:19,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:19,386 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) [2020-10-19 20:26:19,420 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-19 20:26:19,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:19,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:19,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:19,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:19,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:19,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:19,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:19,425 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) [2020-10-19 20:26:19,456 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-19 20:26:19,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:19,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:19,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:19,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:19,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:19,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:19,466 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) [2020-10-19 20:26:19,504 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-19 20:26:19,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:19,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:19,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:19,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:19,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:19,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:19,522 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-19 20:26:19,567 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-19 20:26:19,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:19,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:19,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:19,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:19,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:19,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:19,578 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) [2020-10-19 20:26:19,612 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-19 20:26:19,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:19,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:19,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:19,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:19,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:19,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:19,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:19,617 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) [2020-10-19 20:26:19,650 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-19 20:26:19,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:19,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:19,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:19,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:19,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:19,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:19,659 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-19 20:26:19,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:19,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:19,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:19,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:19,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:19,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:19,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:19,710 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:26:19,736 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-19 20:26:19,736 INFO L444 ModelExtractionUtils]: 13 out of 28 variables were initially zero. Simplification set additionally 11 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) [2020-10-19 20:26:19,739 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:19,742 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:26:19,743 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:26:19,743 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~nondetString2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_main_~i~1 - 1*ULTIMATE.start_main_~nondetString2~0.offset Supporting invariants [] [2020-10-19 20:26:19,790 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-10-19 20:26:19,796 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:26:19,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:19,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:26:19,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:19,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:26:19,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:19,876 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-19 20:26:19,877 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-19 20:26:19,877 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-10-19 20:26:19,906 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 25 states and 35 transitions. Complement of second has 6 states. [2020-10-19 20:26:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:26:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:26:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-10-19 20:26:19,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 2 letters. [2020-10-19 20:26:19,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:19,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 2 letters. [2020-10-19 20:26:19,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:19,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 4 letters. [2020-10-19 20:26:19,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:19,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. [2020-10-19 20:26:19,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 20:26:19,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 24 transitions. [2020-10-19 20:26:19,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-19 20:26:19,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 20:26:19,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2020-10-19 20:26:19,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:26:19,913 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-10-19 20:26:19,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2020-10-19 20:26:19,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-10-19 20:26:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-19 20:26:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2020-10-19 20:26:19,915 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-10-19 20:26:19,915 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-10-19 20:26:19,916 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 20:26:19,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2020-10-19 20:26:19,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 20:26:19,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:19,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:19,918 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:19,918 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:26:19,918 INFO L794 eck$LassoCheckResult]: Stem: 326#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 324#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 325#L528 assume !(main_~length1~0 < 1); 316#L528-2 assume !(main_~length2~0 < 1); 317#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 321#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 319#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 320#L537-3 assume !(main_~i~0 < main_~length1~0); 322#L537-4 main_~i~1 := 0; 323#L541-3 assume !(main_~i~1 < main_~length2~0); 314#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 315#L519-4 [2020-10-19 20:26:19,919 INFO L796 eck$LassoCheckResult]: Loop: 315#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 318#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 312#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 313#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 315#L519-4 [2020-10-19 20:26:19,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:19,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2020-10-19 20:26:19,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:19,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247794482] [2020-10-19 20:26:19,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:26:19,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247794482] [2020-10-19 20:26:19,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:26:19,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:26:19,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664144814] [2020-10-19 20:26:19,954 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:26:19,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:19,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2406249, now seen corresponding path program 1 times [2020-10-19 20:26:19,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:19,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411449742] [2020-10-19 20:26:19,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:19,962 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:19,967 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:19,969 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:20,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:26:20,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:26:20,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:26:20,062 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-19 20:26:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:26:20,083 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-10-19 20:26:20,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:26:20,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2020-10-19 20:26:20,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 20:26:20,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 24 transitions. [2020-10-19 20:26:20,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 20:26:20,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 20:26:20,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2020-10-19 20:26:20,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:26:20,086 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-19 20:26:20,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2020-10-19 20:26:20,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-10-19 20:26:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-19 20:26:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2020-10-19 20:26:20,088 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-10-19 20:26:20,088 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-10-19 20:26:20,088 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 20:26:20,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2020-10-19 20:26:20,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 20:26:20,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:20,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:20,089 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:20,089 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:26:20,090 INFO L794 eck$LassoCheckResult]: Stem: 370#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 368#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 369#L528 assume !(main_~length1~0 < 1); 360#L528-2 assume !(main_~length2~0 < 1); 361#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 365#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 363#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 364#L537-3 assume !(main_~i~0 < main_~length1~0); 366#L537-4 main_~i~1 := 0; 367#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 372#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 373#L541-3 assume !(main_~i~1 < main_~length2~0); 358#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 359#L519-4 [2020-10-19 20:26:20,090 INFO L796 eck$LassoCheckResult]: Loop: 359#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 362#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 356#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 357#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 359#L519-4 [2020-10-19 20:26:20,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:20,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2020-10-19 20:26:20,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:20,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090940990] [2020-10-19 20:26:20,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:20,120 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:20,149 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:20,157 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:20,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2406249, now seen corresponding path program 2 times [2020-10-19 20:26:20,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:20,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191757173] [2020-10-19 20:26:20,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:20,176 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:20,184 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:20,187 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:20,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:20,191 INFO L82 PathProgramCache]: Analyzing trace with hash -796589374, now seen corresponding path program 1 times [2020-10-19 20:26:20,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:20,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239129795] [2020-10-19 20:26:20,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:26:20,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239129795] [2020-10-19 20:26:20,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177602134] [2020-10-19 20:26:20,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:26:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:20,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-19 20:26:20,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:20,552 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-19 20:26:20,553 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:20,562 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:20,563 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:26:20,563 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2020-10-19 20:26:20,688 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2020-10-19 20:26:20,688 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:20,703 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:20,710 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-10-19 20:26:20,711 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:53, output treesize:37 [2020-10-19 20:26:20,825 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-19 20:26:20,826 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-10-19 20:26:20,828 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:20,841 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:20,845 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:26:20,845 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:47, output treesize:3 [2020-10-19 20:26:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:26:20,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:26:20,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2020-10-19 20:26:20,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599475476] [2020-10-19 20:26:20,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:26:20,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-19 20:26:20,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-19 20:26:20,948 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand 12 states. [2020-10-19 20:26:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:26:21,275 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2020-10-19 20:26:21,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 20:26:21,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 34 transitions. [2020-10-19 20:26:21,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 20:26:21,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 26 transitions. [2020-10-19 20:26:21,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 20:26:21,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 20:26:21,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2020-10-19 20:26:21,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:26:21,279 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-10-19 20:26:21,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2020-10-19 20:26:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-10-19 20:26:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-19 20:26:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2020-10-19 20:26:21,281 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-10-19 20:26:21,281 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-10-19 20:26:21,281 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 20:26:21,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2020-10-19 20:26:21,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 20:26:21,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:21,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:21,283 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:21,283 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 20:26:21,283 INFO L794 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 490#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 491#L528 assume !(main_~length1~0 < 1); 481#L528-2 assume !(main_~length2~0 < 1); 482#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 486#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 484#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 485#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 487#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 496#L537-3 assume !(main_~i~0 < main_~length1~0); 488#L537-4 main_~i~1 := 0; 489#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 494#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 495#L541-3 assume !(main_~i~1 < main_~length2~0); 479#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 480#L519-4 [2020-10-19 20:26:21,283 INFO L796 eck$LassoCheckResult]: Loop: 480#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 483#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 477#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 478#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 480#L519-4 [2020-10-19 20:26:21,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:21,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1523394364, now seen corresponding path program 2 times [2020-10-19 20:26:21,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:21,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223847152] [2020-10-19 20:26:21,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:21,296 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:21,308 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:21,312 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:21,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2406249, now seen corresponding path program 3 times [2020-10-19 20:26:21,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:21,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373183880] [2020-10-19 20:26:21,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:21,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:21,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:21,323 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:21,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1430636836, now seen corresponding path program 2 times [2020-10-19 20:26:21,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:21,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017258394] [2020-10-19 20:26:21,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:21,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:21,353 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:21,359 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:22,421 WARN L193 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 122 [2020-10-19 20:26:22,766 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-19 20:26:22,773 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:26:22,773 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:26:22,773 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:26:22,773 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:26:22,774 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:26:22,774 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:22,774 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:26:22,774 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:26:22,774 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration6_Lasso [2020-10-19 20:26:22,774 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:26:22,774 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:26:22,783 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-19 20:26:22,793 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-19 20:26:22,795 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-19 20:26:22,797 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-19 20:26:22,799 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-19 20:26:22,802 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-19 20:26:22,805 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-19 20:26:23,266 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2020-10-19 20:26:23,426 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2020-10-19 20:26:23,427 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-19 20:26:23,431 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-19 20:26:23,434 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-19 20:26:23,436 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-19 20:26:23,438 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-19 20:26:23,442 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-19 20:26:23,445 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-19 20:26:23,448 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-19 20:26:23,452 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-19 20:26:23,454 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-19 20:26:23,463 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-19 20:26:23,465 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-19 20:26:23,467 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-19 20:26:23,469 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-19 20:26:23,471 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-19 20:26:23,474 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-19 20:26:23,477 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-19 20:26:23,687 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2020-10-19 20:26:24,155 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:26:24,155 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:24,161 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-19 20:26:24,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:24,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:24,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:24,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:24,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:24,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:24,170 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:24,190 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-19 20:26:24,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:24,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:24,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:24,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:24,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:24,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:24,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:24,193 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:24,215 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-19 20:26:24,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:24,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:24,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:24,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:24,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:24,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:24,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:24,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:24,242 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-19 20:26:24,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:24,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:24,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:24,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:24,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:24,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:24,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:24,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:24,280 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:24,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:24,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:24,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:24,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:24,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:24,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:24,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:24,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:24,307 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-19 20:26:24,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:24,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:24,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:24,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:24,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:24,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:24,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:24,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:24,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:24,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:24,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:24,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:24,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:24,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:24,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:24,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:24,383 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-19 20:26:24,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:24,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:24,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:24,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:24,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:24,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:24,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:24,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:24,411 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-19 20:26:24,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:24,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:24,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:24,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:24,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:24,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:24,420 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:24,445 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-19 20:26:24,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:24,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:24,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:24,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:24,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:24,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:24,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:24,476 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-19 20:26:24,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:24,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:24,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:24,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:24,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:24,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:24,520 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:26:24,712 INFO L443 ModelExtractionUtils]: Simplification made 42 calls to the SMT solver. [2020-10-19 20:26:24,712 INFO L444 ModelExtractionUtils]: 14 out of 58 variables were initially zero. Simplification set additionally 41 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:24,716 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:24,721 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:26:24,721 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:26:24,722 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_3 Supporting invariants [] [2020-10-19 20:26:24,826 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2020-10-19 20:26:24,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:26:24,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:24,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 20:26:24,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:24,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-19 20:26:24,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:24,941 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-19 20:26:24,941 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-19 20:26:24,942 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-19 20:26:25,033 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 26 states and 32 transitions. Complement of second has 5 states. [2020-10-19 20:26:25,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 20:26:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 20:26:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2020-10-19 20:26:25,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 15 letters. Loop has 4 letters. [2020-10-19 20:26:25,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:25,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-19 20:26:25,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:25,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 15 letters. Loop has 8 letters. [2020-10-19 20:26:25,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:25,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2020-10-19 20:26:25,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:25,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 31 transitions. [2020-10-19 20:26:25,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-19 20:26:25,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 20:26:25,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2020-10-19 20:26:25,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:26:25,042 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-10-19 20:26:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2020-10-19 20:26:25,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-10-19 20:26:25,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-19 20:26:25,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2020-10-19 20:26:25,044 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-10-19 20:26:25,044 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-10-19 20:26:25,044 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 20:26:25,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2020-10-19 20:26:25,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:25,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:25,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:25,046 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:25,046 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:26:25,046 INFO L794 eck$LassoCheckResult]: Stem: 690#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 688#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 689#L528 assume !(main_~length1~0 < 1); 678#L528-2 assume !(main_~length2~0 < 1); 679#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 684#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 682#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 683#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 685#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 695#L537-3 assume !(main_~i~0 < main_~length1~0); 686#L537-4 main_~i~1 := 0; 687#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 693#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 694#L541-3 assume !(main_~i~1 < main_~length2~0); 676#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 677#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 680#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 672#L519-3 [2020-10-19 20:26:25,046 INFO L796 eck$LassoCheckResult]: Loop: 672#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 673#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 691#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 672#L519-3 [2020-10-19 20:26:25,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:25,046 INFO L82 PathProgramCache]: Analyzing trace with hash -601862591, now seen corresponding path program 1 times [2020-10-19 20:26:25,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:25,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972147289] [2020-10-19 20:26:25,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:25,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:25,076 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:25,083 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:25,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:25,088 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 1 times [2020-10-19 20:26:25,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:25,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276286515] [2020-10-19 20:26:25,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:25,092 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:25,094 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:25,095 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:25,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:25,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1400069085, now seen corresponding path program 1 times [2020-10-19 20:26:25,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:25,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586645901] [2020-10-19 20:26:25,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-19 20:26:25,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586645901] [2020-10-19 20:26:25,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259873561] [2020-10-19 20:26:25,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:26:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:25,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-19 20:26:25,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:25,429 INFO L350 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2020-10-19 20:26:25,429 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2020-10-19 20:26:25,429 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:25,441 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:25,445 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-10-19 20:26:25,445 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:49, output treesize:33 [2020-10-19 20:26:25,533 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-19 20:26:25,535 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:25,536 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2020-10-19 20:26:25,537 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:25,546 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:25,548 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:26:25,549 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:3 [2020-10-19 20:26:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-19 20:26:25,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:26:25,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-10-19 20:26:25,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400378466] [2020-10-19 20:26:25,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:26:25,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-19 20:26:25,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-10-19 20:26:25,590 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. cyclomatic complexity: 10 Second operand 16 states. [2020-10-19 20:26:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:26:26,050 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2020-10-19 20:26:26,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-19 20:26:26,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 50 transitions. [2020-10-19 20:26:26,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:26,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 30 states and 37 transitions. [2020-10-19 20:26:26,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 20:26:26,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 20:26:26,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2020-10-19 20:26:26,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:26:26,054 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-10-19 20:26:26,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2020-10-19 20:26:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2020-10-19 20:26:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-19 20:26:26,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2020-10-19 20:26:26,057 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-10-19 20:26:26,057 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-10-19 20:26:26,057 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 20:26:26,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2020-10-19 20:26:26,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:26,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:26,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:26,058 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:26,059 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:26:26,059 INFO L794 eck$LassoCheckResult]: Stem: 849#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 847#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 848#L528 assume !(main_~length1~0 < 1); 837#L528-2 assume !(main_~length2~0 < 1); 838#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 843#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 841#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 842#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 844#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 856#L537-3 assume !(main_~i~0 < main_~length1~0); 845#L537-4 main_~i~1 := 0; 846#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 852#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 853#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 854#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 855#L541-3 assume !(main_~i~1 < main_~length2~0); 835#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 836#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 839#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 831#L519-3 [2020-10-19 20:26:26,059 INFO L796 eck$LassoCheckResult]: Loop: 831#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 832#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 850#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 831#L519-3 [2020-10-19 20:26:26,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:26,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1483803875, now seen corresponding path program 2 times [2020-10-19 20:26:26,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:26,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367204231] [2020-10-19 20:26:26,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:26,074 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:26,086 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:26,091 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:26,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:26,092 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 2 times [2020-10-19 20:26:26,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:26,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957302307] [2020-10-19 20:26:26,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:26,096 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:26,097 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:26,099 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:26,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:26,099 INFO L82 PathProgramCache]: Analyzing trace with hash 197886459, now seen corresponding path program 2 times [2020-10-19 20:26:26,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:26,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596264267] [2020-10-19 20:26:26,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:26,113 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:26,127 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:26,135 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:28,183 WARN L193 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 186 DAG size of output: 154 [2020-10-19 20:26:28,659 WARN L193 SmtUtils]: Spent 461.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-19 20:26:28,661 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:26:28,662 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:26:28,662 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:26:28,662 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:26:28,662 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:26:28,662 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:28,662 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:26:28,662 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:26:28,662 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration8_Lasso [2020-10-19 20:26:28,662 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:26:28,663 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:26:28,666 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-19 20:26:28,670 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-19 20:26:28,672 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-19 20:26:28,675 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-19 20:26:28,678 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-19 20:26:29,181 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2020-10-19 20:26:29,304 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-10-19 20:26:29,305 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-19 20:26:29,307 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-19 20:26:29,309 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-19 20:26:29,317 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-19 20:26:29,319 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-19 20:26:29,325 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-19 20:26:29,327 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-19 20:26:29,329 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-19 20:26:29,331 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-19 20:26:29,334 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-19 20:26:29,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:29,339 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-19 20:26:29,341 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-19 20:26:29,343 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-19 20:26:29,346 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-19 20:26:29,348 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-19 20:26:29,349 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-19 20:26:29,352 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-19 20:26:29,354 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-19 20:26:29,593 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2020-10-19 20:26:30,140 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:26:30,141 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:30,157 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-19 20:26:30,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:30,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:30,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:30,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:30,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:30,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:30,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:30,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:30,206 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-19 20:26:30,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:30,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:30,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:30,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:30,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:30,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:30,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:30,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:30,249 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-19 20:26:30,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:30,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:30,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:30,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:30,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:30,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:30,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:30,292 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-19 20:26:30,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:30,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:30,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:30,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:30,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:30,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:30,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:30,323 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-19 20:26:30,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:30,326 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-19 20:26:30,326 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2020-10-19 20:26:30,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:30,350 INFO L401 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2020-10-19 20:26:30,350 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2020-10-19 20:26:30,406 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:30,429 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-19 20:26:30,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:30,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:30,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:30,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:30,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:30,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:30,463 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:26:30,540 INFO L443 ModelExtractionUtils]: Simplification made 25 calls to the SMT solver. [2020-10-19 20:26:30,540 INFO L444 ModelExtractionUtils]: 22 out of 58 variables were initially zero. Simplification set additionally 33 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:30,543 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:26:30,545 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:26:30,545 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:26:30,545 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_4, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_4 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2020-10-19 20:26:30,648 INFO L297 tatePredicateManager]: 19 out of 21 supporting invariants were superfluous and have been removed [2020-10-19 20:26:30,652 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:26:30,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:30,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:26:30,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:30,740 WARN L261 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-19 20:26:30,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:30,771 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-19 20:26:30,771 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-19 20:26:30,771 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-10-19 20:26:30,823 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 43 states and 52 transitions. Complement of second has 7 states. [2020-10-19 20:26:30,823 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-19 20:26:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 20:26:30,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-10-19 20:26:30,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 19 letters. Loop has 3 letters. [2020-10-19 20:26:30,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:30,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 22 letters. Loop has 3 letters. [2020-10-19 20:26:30,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:30,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 19 letters. Loop has 6 letters. [2020-10-19 20:26:30,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:30,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2020-10-19 20:26:30,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:30,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 33 states and 41 transitions. [2020-10-19 20:26:30,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-19 20:26:30,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-19 20:26:30,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2020-10-19 20:26:30,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:26:30,829 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2020-10-19 20:26:30,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2020-10-19 20:26:30,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2020-10-19 20:26:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-19 20:26:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-10-19 20:26:30,832 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-10-19 20:26:30,832 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-10-19 20:26:30,832 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 20:26:30,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2020-10-19 20:26:30,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:30,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:30,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:30,834 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:30,834 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:26:30,835 INFO L794 eck$LassoCheckResult]: Stem: 1101#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1099#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 1100#L528 assume !(main_~length1~0 < 1); 1088#L528-2 assume !(main_~length2~0 < 1); 1089#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 1095#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1093#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1094#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1096#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1107#L537-3 assume !(main_~i~0 < main_~length1~0); 1097#L537-4 main_~i~1 := 0; 1098#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1104#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1105#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1106#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1108#L541-3 assume !(main_~i~1 < main_~length2~0); 1086#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 1087#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1090#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1084#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1085#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 1091#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1092#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1082#L519-3 [2020-10-19 20:26:30,835 INFO L796 eck$LassoCheckResult]: Loop: 1082#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1083#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 1102#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 1082#L519-3 [2020-10-19 20:26:30,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:30,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1839510475, now seen corresponding path program 3 times [2020-10-19 20:26:30,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:30,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501273260] [2020-10-19 20:26:30,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-19 20:26:31,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501273260] [2020-10-19 20:26:31,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893633509] [2020-10-19 20:26:31,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:26:31,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-19 20:26:31,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:26:31,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 39 conjunts are in the unsatisfiable core [2020-10-19 20:26:31,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:31,217 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_129|], 1=[|v_#valid_152|]} [2020-10-19 20:26:31,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 20:26:31,221 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-10-19 20:26:31,222 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:31,229 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:31,236 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-19 20:26:31,238 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:31,246 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:31,246 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:26:31,246 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-10-19 20:26:31,349 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2020-10-19 20:26:31,349 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:31,368 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:31,370 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-19 20:26:31,370 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:41 [2020-10-19 20:26:31,497 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2020-10-19 20:26:31,499 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-19 20:26:31,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:31,520 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-19 20:26:31,521 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-10-19 20:26:31,523 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:31,530 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:31,533 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:26:31,533 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:55, output treesize:3 [2020-10-19 20:26:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-19 20:26:31,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:26:31,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2020-10-19 20:26:31,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073491997] [2020-10-19 20:26:31,538 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:26:31,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:31,538 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 3 times [2020-10-19 20:26:31,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:31,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790319019] [2020-10-19 20:26:31,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:31,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:31,544 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:31,545 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:31,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:26:31,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-19 20:26:31,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-10-19 20:26:31,590 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 10 Second operand 16 states. [2020-10-19 20:26:32,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:26:32,226 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-10-19 20:26:32,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 20:26:32,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2020-10-19 20:26:32,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:32,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 30 states and 36 transitions. [2020-10-19 20:26:32,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-19 20:26:32,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-19 20:26:32,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2020-10-19 20:26:32,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:26:32,229 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-10-19 20:26:32,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2020-10-19 20:26:32,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-10-19 20:26:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-19 20:26:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2020-10-19 20:26:32,231 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-10-19 20:26:32,231 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-10-19 20:26:32,232 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 20:26:32,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2020-10-19 20:26:32,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:32,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:32,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:32,233 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:32,233 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:26:32,233 INFO L794 eck$LassoCheckResult]: Stem: 1274#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1272#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 1273#L528 assume !(main_~length1~0 < 1); 1260#L528-2 assume !(main_~length2~0 < 1); 1261#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 1267#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1268#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1282#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1265#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1266#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1269#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1281#L537-3 assume !(main_~i~0 < main_~length1~0); 1270#L537-4 main_~i~1 := 0; 1271#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1279#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1280#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1277#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1278#L541-3 assume !(main_~i~1 < main_~length2~0); 1258#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 1259#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1262#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1256#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1257#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 1263#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1264#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1254#L519-3 [2020-10-19 20:26:32,234 INFO L796 eck$LassoCheckResult]: Loop: 1254#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1255#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 1275#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 1254#L519-3 [2020-10-19 20:26:32,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:32,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1269061459, now seen corresponding path program 4 times [2020-10-19 20:26:32,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:32,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344457295] [2020-10-19 20:26:32,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:32,250 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:32,267 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:32,272 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:32,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:32,273 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 4 times [2020-10-19 20:26:32,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:32,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281827816] [2020-10-19 20:26:32,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:32,276 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:32,277 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:32,279 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:32,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:32,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1987238385, now seen corresponding path program 1 times [2020-10-19 20:26:32,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:32,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28295085] [2020-10-19 20:26:32,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-19 20:26:32,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28295085] [2020-10-19 20:26:32,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439488018] [2020-10-19 20:26:32,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:26:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:32,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 40 conjunts are in the unsatisfiable core [2020-10-19 20:26:32,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:32,447 INFO L350 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2020-10-19 20:26:32,448 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2020-10-19 20:26:32,448 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:32,454 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:32,455 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-19 20:26:32,455 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:21 [2020-10-19 20:26:44,694 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-10-19 20:26:44,694 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:44,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:44,696 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:26:44,697 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-10-19 20:26:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-19 20:26:44,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:26:44,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2020-10-19 20:26:44,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819512300] [2020-10-19 20:26:44,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:26:44,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-19 20:26:44,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=68, Unknown=1, NotChecked=0, Total=90 [2020-10-19 20:26:44,738 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand 10 states. [2020-10-19 20:26:44,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:26:44,898 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2020-10-19 20:26:44,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 20:26:44,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 51 transitions. [2020-10-19 20:26:44,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:44,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 44 transitions. [2020-10-19 20:26:44,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 20:26:44,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 20:26:44,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2020-10-19 20:26:44,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:26:44,901 INFO L691 BuchiCegarLoop]: Abstraction has 38 states and 44 transitions. [2020-10-19 20:26:44,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2020-10-19 20:26:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-10-19 20:26:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-19 20:26:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2020-10-19 20:26:44,904 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-10-19 20:26:44,904 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-10-19 20:26:44,904 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 20:26:44,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2020-10-19 20:26:44,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:44,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:44,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:44,906 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:44,906 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:26:44,906 INFO L794 eck$LassoCheckResult]: Stem: 1452#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1450#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 1451#L528 assume !(main_~length1~0 < 1); 1439#L528-2 assume !(main_~length2~0 < 1); 1440#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 1446#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1444#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1445#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1447#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1463#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1461#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1460#L537-3 assume !(main_~i~0 < main_~length1~0); 1448#L537-4 main_~i~1 := 0; 1449#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1456#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1457#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1458#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1459#L541-3 assume !(main_~i~1 < main_~length2~0); 1437#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 1438#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1441#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1435#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1436#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 1454#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 1455#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1462#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 1442#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 1443#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 1433#L519-3 [2020-10-19 20:26:44,906 INFO L796 eck$LassoCheckResult]: Loop: 1433#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 1434#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 1453#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 1433#L519-3 [2020-10-19 20:26:44,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:44,907 INFO L82 PathProgramCache]: Analyzing trace with hash 2062165185, now seen corresponding path program 2 times [2020-10-19 20:26:44,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:44,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9271921] [2020-10-19 20:26:44,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:44,922 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:44,937 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:44,942 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:44,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:44,943 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 5 times [2020-10-19 20:26:44,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:44,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113087236] [2020-10-19 20:26:44,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:44,946 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:44,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:44,949 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:44,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:44,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1249118883, now seen corresponding path program 3 times [2020-10-19 20:26:44,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:44,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696652348] [2020-10-19 20:26:44,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:44,965 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:44,981 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:44,986 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:49,574 WARN L193 SmtUtils]: Spent 4.54 s on a formula simplification. DAG size of input: 271 DAG size of output: 223 [2020-10-19 20:26:50,361 WARN L193 SmtUtils]: Spent 756.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-10-19 20:26:50,364 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:26:50,364 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:26:50,364 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:26:50,365 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:26:50,365 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:26:50,365 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:50,365 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:26:50,365 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:26:50,365 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration11_Lasso [2020-10-19 20:26:50,365 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:26:50,366 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:26:50,369 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-19 20:26:50,372 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-19 20:26:50,374 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-19 20:26:50,377 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-19 20:26:50,380 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-19 20:26:50,383 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-19 20:26:50,387 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-19 20:26:50,390 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-19 20:26:50,394 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-19 20:26:50,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-19 20:26:50,398 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-19 20:26:50,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-19 20:26:50,404 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-19 20:26:50,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-19 20:26:50,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-19 20:26:50,411 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-19 20:26:50,414 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-19 20:26:50,417 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-19 20:26:50,420 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-19 20:26:51,218 WARN L193 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 106 [2020-10-19 20:26:51,353 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2020-10-19 20:26:51,353 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-19 20:26:51,356 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-19 20:26:51,358 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-19 20:26:51,361 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-19 20:26:51,642 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2020-10-19 20:26:51,982 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-19 20:26:52,570 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-10-19 20:26:52,644 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:26:52,644 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:52,652 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-19 20:26:52,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:52,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:52,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:52,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:52,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:52,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:52,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:52,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:26:52,678 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-19 20:26:52,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:52,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:52,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:52,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:52,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:52,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:52,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:52,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:52,706 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-19 20:26:52,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:52,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:52,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:52,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:52,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:52,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:52,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:52,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:52,732 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-19 20:26:52,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:52,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:52,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:52,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:52,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:52,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:52,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:52,762 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-19 20:26:52,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:52,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:52,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:52,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:52,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:52,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:52,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:52,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:52,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:52,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:52,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:52,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:52,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:52,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:52,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:52,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:52,815 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-19 20:26:52,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:52,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:52,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:52,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:52,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:52,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:52,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:52,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:52,841 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-19 20:26:52,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:52,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:52,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:52,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:52,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:52,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:52,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:52,844 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:52,870 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-19 20:26:52,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:52,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:52,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:52,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:52,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:52,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:52,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:52,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26: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-19 20:26:52,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:52,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:52,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:52,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:52,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:52,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:52,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:52,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:52,937 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-19 20:26:52,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:52,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:52,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:52,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:52,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:52,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:52,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:52,940 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:52,962 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-19 20:26:52,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:52,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:52,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:52,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:52,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:52,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:52,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:52,965 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:52,987 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-19 20:26:52,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:52,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:52,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:52,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:52,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:52,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:52,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26: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 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:53,014 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-19 20:26:53,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:53,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:53,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:53,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:53,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:53,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:53,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:53,017 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 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:53,039 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-19 20:26:53,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:53,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:53,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:53,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:53,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:53,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:53,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:53,042 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 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:53,064 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-19 20:26:53,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:53,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:53,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:53,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:53,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:53,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:53,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:53,067 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 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:53,090 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-19 20:26:53,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:53,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:53,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:53,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:53,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:53,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:53,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:53,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:53,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:53,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:53,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:53,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:53,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:53,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:53,124 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 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:53,146 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-19 20:26:53,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:53,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:53,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:53,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:53,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:53,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:53,183 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:26:53,217 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2020-10-19 20:26:53,218 INFO L444 ModelExtractionUtils]: 29 out of 61 variables were initially zero. Simplification set additionally 26 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:53,220 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:26:53,222 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 20:26:53,222 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:26:53,222 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_cstrpbrk_~scanp~0.offset + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [1*ULTIMATE.start_cstrpbrk_~s1.offset - 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_3 - 1*ULTIMATE.start_main_~nondetString2~0.offset >= 0] [2020-10-19 20:26:53,377 INFO L297 tatePredicateManager]: 26 out of 28 supporting invariants were superfluous and have been removed [2020-10-19 20:26:53,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:53,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 34 conjunts are in the unsatisfiable core [2020-10-19 20:26:53,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:53,472 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:53,473 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-10-19 20:26:53,473 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:53,499 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-10-19 20:26:53,501 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:26:53,501 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-10-19 20:26:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:53,762 WARN L261 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-19 20:26:53,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:53,797 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-19 20:26:53,798 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2020-10-19 20:26:53,798 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand 12 states. [2020-10-19 20:26:54,116 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 10. Second operand 12 states. Result 38 states and 45 transitions. Complement of second has 11 states. [2020-10-19 20:26:54,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states [2020-10-19 20:26:54,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-19 20:26:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2020-10-19 20:26:54,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 27 transitions. Stem has 28 letters. Loop has 3 letters. [2020-10-19 20:26:54,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:54,118 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 20:26:54,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:54,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 38 conjunts are in the unsatisfiable core [2020-10-19 20:26:54,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:54,219 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:54,219 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-10-19 20:26:54,220 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:54,246 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-10-19 20:26:54,248 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:26:54,249 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-10-19 20:26:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:54,500 WARN L261 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-19 20:26:54,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:54,539 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-19 20:26:54,540 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2020-10-19 20:26:54,540 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand 12 states. [2020-10-19 20:26:54,865 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 10. Second operand 12 states. Result 38 states and 45 transitions. Complement of second has 11 states. [2020-10-19 20:26:54,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states [2020-10-19 20:26:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-19 20:26:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2020-10-19 20:26:54,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 27 transitions. Stem has 28 letters. Loop has 3 letters. [2020-10-19 20:26:54,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:54,868 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 20:26:54,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:54,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 34 conjunts are in the unsatisfiable core [2020-10-19 20:26:54,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:54,964 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:54,964 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-10-19 20:26:54,965 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:54,992 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-10-19 20:26:55,000 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:26:55,001 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-10-19 20:26:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:55,274 WARN L261 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-19 20:26:55,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:55,310 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-19 20:26:55,310 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2020-10-19 20:26:55,311 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand 12 states. [2020-10-19 20:26:55,778 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 37 transitions. cyclomatic complexity: 10. Second operand 12 states. Result 73 states and 86 transitions. Complement of second has 16 states. [2020-10-19 20:26:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 10 stem states 1 non-accepting loop states 2 accepting loop states [2020-10-19 20:26:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-19 20:26:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2020-10-19 20:26:55,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 57 transitions. Stem has 28 letters. Loop has 3 letters. [2020-10-19 20:26:55,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:55,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 57 transitions. Stem has 31 letters. Loop has 3 letters. [2020-10-19 20:26:55,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:55,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 57 transitions. Stem has 28 letters. Loop has 6 letters. [2020-10-19 20:26:55,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:55,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 86 transitions. [2020-10-19 20:26:55,782 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-19 20:26:55,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 64 states and 75 transitions. [2020-10-19 20:26:55,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-19 20:26:55,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-10-19 20:26:55,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 75 transitions. [2020-10-19 20:26:55,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:26:55,784 INFO L691 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2020-10-19 20:26:55,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 75 transitions. [2020-10-19 20:26:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2020-10-19 20:26:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-19 20:26:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2020-10-19 20:26:55,787 INFO L714 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2020-10-19 20:26:55,787 INFO L594 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2020-10-19 20:26:55,788 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 20:26:55,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2020-10-19 20:26:55,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:55,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:55,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:55,789 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:55,789 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:26:55,790 INFO L794 eck$LassoCheckResult]: Stem: 2152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2150#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 2151#L528 assume !(main_~length1~0 < 1); 2139#L528-2 assume !(main_~length2~0 < 1); 2140#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 2146#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 2144#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 2145#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 2147#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 2162#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 2161#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 2160#L537-3 assume !(main_~i~0 < main_~length1~0); 2148#L537-4 main_~i~1 := 0; 2149#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 2158#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 2159#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 2156#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 2157#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 2165#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 2163#L541-3 assume !(main_~i~1 < main_~length2~0); 2164#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 2141#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 2142#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 2135#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 2136#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 2154#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 2155#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 2166#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 2167#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 2168#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 2133#L519-3 [2020-10-19 20:26:55,790 INFO L796 eck$LassoCheckResult]: Loop: 2133#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 2134#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 2153#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 2133#L519-3 [2020-10-19 20:26:55,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:55,790 INFO L82 PathProgramCache]: Analyzing trace with hash 659963103, now seen corresponding path program 4 times [2020-10-19 20:26:55,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:55,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555178118] [2020-10-19 20:26:55,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:55,807 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:55,823 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:55,828 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:55,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:55,829 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 6 times [2020-10-19 20:26:55,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:55,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303486921] [2020-10-19 20:26:55,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:55,832 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:55,834 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:55,835 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:55,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:55,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1399422849, now seen corresponding path program 5 times [2020-10-19 20:26:55,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:55,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378834229] [2020-10-19 20:26:55,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:55,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:55,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:55,873 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:01,631 WARN L193 SmtUtils]: Spent 5.71 s on a formula simplification. DAG size of input: 285 DAG size of output: 230 [2020-10-19 20:27:02,600 WARN L193 SmtUtils]: Spent 941.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-10-19 20:27:02,602 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:27:02,603 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:27:02,603 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:27:02,603 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:27:02,603 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:27:02,603 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:02,603 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:27:02,603 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:27:02,603 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration12_Lasso [2020-10-19 20:27:02,603 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:27:02,603 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:27:02,608 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-19 20:27:02,618 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-19 20:27:02,621 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-19 20:27:02,624 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-19 20:27:02,627 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-19 20:27:03,432 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2020-10-19 20:27:03,596 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2020-10-19 20:27:03,597 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-19 20:27:03,600 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-19 20:27:03,604 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-19 20:27:03,606 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-19 20:27:03,609 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-19 20:27:03,612 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-19 20:27:03,615 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-19 20:27:03,618 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-19 20:27:03,621 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-19 20:27:03,624 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-19 20:27:03,626 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-19 20:27:03,629 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-19 20:27:03,638 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-19 20:27:03,641 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-19 20:27:03,643 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-19 20:27:03,645 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-19 20:27:03,648 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-19 20:27:03,651 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-19 20:27:03,654 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-19 20:27:03,915 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2020-10-19 20:27:04,626 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:27:04,626 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:04,632 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-19 20:27:04,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:04,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:04,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:04,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:04,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:04,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:04,636 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 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:04,659 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-19 20:27:04,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:04,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:04,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:04,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:04,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:04,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:04,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:04,662 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 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:04,684 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-19 20:27:04,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:04,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:04,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:04,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:04,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:04,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:04,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:04,687 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 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:04,710 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-19 20:27:04,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:04,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:04,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:04,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:04,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:04,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:04,715 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:04,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:04,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:04,738 INFO L203 nArgumentSynthesizer]: 6 stem disjuncts [2020-10-19 20:27:04,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:04,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:04,741 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-10-19 20:27:04,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:04,749 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 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:04,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:04,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:04,772 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-19 20:27:04,772 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2020-10-19 20:27:04,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:04,798 INFO L401 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2020-10-19 20:27:04,798 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2020-10-19 20:27:04,867 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 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:04,890 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-19 20:27:04,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:04,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:04,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:04,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:04,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:04,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:04,925 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:27:05,048 INFO L443 ModelExtractionUtils]: Simplification made 35 calls to the SMT solver. [2020-10-19 20:27:05,048 INFO L444 ModelExtractionUtils]: 7 out of 58 variables were initially zero. Simplification set additionally 46 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:05,051 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:27:05,053 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 20:27:05,053 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:27:05,053 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_6, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_6 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_6 - 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_5 >= 0] [2020-10-19 20:27:05,288 INFO L297 tatePredicateManager]: 40 out of 43 supporting invariants were superfluous and have been removed [2020-10-19 20:27:05,294 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:27:05,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:05,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-19 20:27:05,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:05,407 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:27:05,408 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-10-19 20:27:05,408 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:27:05,442 INFO L625 ElimStorePlain]: treesize reduction 10, result has 71.4 percent of original size [2020-10-19 20:27:05,443 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:27:05,443 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2020-10-19 20:27:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:05,744 WARN L261 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-19 20:27:05,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:05,780 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-19 20:27:05,780 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2020-10-19 20:27:05,780 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand 13 states. [2020-10-19 20:27:06,691 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 13. Second operand 13 states. Result 65 states and 78 transitions. Complement of second has 18 states. [2020-10-19 20:27:06,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 13 stem states 1 non-accepting loop states 2 accepting loop states [2020-10-19 20:27:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-19 20:27:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 44 transitions. [2020-10-19 20:27:06,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 44 transitions. Stem has 30 letters. Loop has 3 letters. [2020-10-19 20:27:06,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:06,694 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 20:27:06,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:06,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-19 20:27:06,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:06,790 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:27:06,790 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-10-19 20:27:06,790 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:27:06,824 INFO L625 ElimStorePlain]: treesize reduction 10, result has 71.4 percent of original size [2020-10-19 20:27:06,825 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:27:06,826 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2020-10-19 20:27:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:07,101 WARN L261 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-19 20:27:07,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:07,138 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-19 20:27:07,138 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 2 loop predicates [2020-10-19 20:27:07,139 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand 13 states. [2020-10-19 20:27:08,065 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 13. Second operand 13 states. Result 67 states and 80 transitions. Complement of second has 18 states. [2020-10-19 20:27:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 13 stem states 1 non-accepting loop states 2 accepting loop states [2020-10-19 20:27:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-19 20:27:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 43 transitions. [2020-10-19 20:27:08,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 43 transitions. Stem has 30 letters. Loop has 3 letters. [2020-10-19 20:27:08,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:08,068 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 20:27:08,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:08,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-19 20:27:08,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:08,168 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:27:08,169 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-10-19 20:27:08,169 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:27:08,204 INFO L625 ElimStorePlain]: treesize reduction 10, result has 71.4 percent of original size [2020-10-19 20:27:08,209 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:27:08,209 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2020-10-19 20:27:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:08,497 WARN L261 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-19 20:27:08,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:08,537 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-19 20:27:08,538 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2020-10-19 20:27:08,538 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand 13 states. [2020-10-19 20:27:09,501 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 13. Second operand 13 states. Result 89 states and 105 transitions. Complement of second has 20 states. [2020-10-19 20:27:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 13 stem states 1 non-accepting loop states 2 accepting loop states [2020-10-19 20:27:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-19 20:27:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 59 transitions. [2020-10-19 20:27:09,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 59 transitions. Stem has 30 letters. Loop has 3 letters. [2020-10-19 20:27:09,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:09,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 59 transitions. Stem has 33 letters. Loop has 3 letters. [2020-10-19 20:27:09,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:09,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 59 transitions. Stem has 30 letters. Loop has 6 letters. [2020-10-19 20:27:09,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:09,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 105 transitions. [2020-10-19 20:27:09,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:27:09,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 38 states and 44 transitions. [2020-10-19 20:27:09,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 20:27:09,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-19 20:27:09,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2020-10-19 20:27:09,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:27:09,507 INFO L691 BuchiCegarLoop]: Abstraction has 38 states and 44 transitions. [2020-10-19 20:27:09,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2020-10-19 20:27:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2020-10-19 20:27:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-19 20:27:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2020-10-19 20:27:09,510 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2020-10-19 20:27:09,510 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2020-10-19 20:27:09,510 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-19 20:27:09,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2020-10-19 20:27:09,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:27:09,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:27:09,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:27:09,511 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:27:09,511 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:27:09,512 INFO L794 eck$LassoCheckResult]: Stem: 3072#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3070#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 3071#L528 assume !(main_~length1~0 < 1); 3059#L528-2 assume !(main_~length2~0 < 1); 3060#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 3066#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 3064#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 3065#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 3067#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 3085#L537-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 3083#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 3082#L537-3 assume !(main_~i~0 < main_~length1~0); 3068#L537-4 main_~i~1 := 0; 3069#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 3078#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 3079#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 3076#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 3077#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 3087#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 3086#L541-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 3081#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 3080#L541-3 assume !(main_~i~1 < main_~length2~0); 3057#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 3058#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 3061#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 3055#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 3056#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 3074#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 3075#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 3084#L519-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 3062#L519-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 3063#L518-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 3053#L519-3 [2020-10-19 20:27:09,512 INFO L796 eck$LassoCheckResult]: Loop: 3053#L519-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 3054#L519-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 3073#L520 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 3053#L519-3 [2020-10-19 20:27:09,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:09,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1763493245, now seen corresponding path program 6 times [2020-10-19 20:27:09,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:09,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466325975] [2020-10-19 20:27:09,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:09,530 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:09,548 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:09,557 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:09,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:09,558 INFO L82 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 7 times [2020-10-19 20:27:09,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:09,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807537612] [2020-10-19 20:27:09,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:09,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:09,563 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:09,564 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:09,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:09,565 INFO L82 PathProgramCache]: Analyzing trace with hash 187353889, now seen corresponding path program 7 times [2020-10-19 20:27:09,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:27:09,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484750400] [2020-10-19 20:27:09,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:27:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:09,584 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:27:09,603 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:27:09,608 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:27:17,901 WARN L193 SmtUtils]: Spent 8.24 s on a formula simplification. DAG size of input: 299 DAG size of output: 239 [2020-10-19 20:27:18,963 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 140 [2020-10-19 20:27:18,967 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:27:18,967 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:27:18,967 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:27:18,967 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:27:18,967 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:27:18,967 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:18,968 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:27:18,968 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:27:18,968 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration13_Lasso [2020-10-19 20:27:18,968 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:27:18,968 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:27:18,971 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-19 20:27:18,974 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-19 20:27:18,977 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-19 20:27:18,991 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-19 20:27:18,995 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-19 20:27:18,998 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-19 20:27:19,002 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-19 20:27:19,006 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-19 20:27:19,009 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-19 20:27:19,012 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-19 20:27:19,017 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-19 20:27:19,019 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-19 20:27:19,022 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-19 20:27:19,025 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-19 20:27:19,957 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2020-10-19 20:27:20,131 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2020-10-19 20:27:20,132 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-19 20:27:20,135 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-19 20:27:20,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-19 20:27:20,142 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-19 20:27:20,145 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-19 20:27:20,147 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-19 20:27:20,150 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-19 20:27:20,153 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-19 20:27:20,156 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-19 20:27:20,159 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-19 20:27:20,163 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-19 20:27:21,640 WARN L193 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2020-10-19 20:27:21,728 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:27:21,729 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,732 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-19 20:27:21,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:21,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:21,737 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 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,759 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-19 20:27:21,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:21,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:21,765 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 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,788 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-19 20:27:21,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,791 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 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,813 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-19 20:27:21,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,815 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:21,815 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:21,819 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 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,841 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-19 20:27:21,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:21,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:21,847 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 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,870 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-19 20:27:21,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,875 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 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,897 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-19 20:27:21,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,900 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 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,929 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 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:27:21,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:21,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:21,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:27:21,954 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 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:21,981 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-19 20:27:21,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:21,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:21,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:21,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:21,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:21,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:27:21,987 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:22,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-19 20:27:22,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:22,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:22,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:22,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:22,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:22,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:22,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:22,031 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:22,085 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-19 20:27:22,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:22,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:22,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:22,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:22,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:22,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:22,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:22,093 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:22,153 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-19 20:27:22,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:22,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:27:22,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:22,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:22,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:22,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:27:22,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:22,158 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:22,212 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-19 20:27:22,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:22,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:22,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:22,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:22,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:22,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:22,222 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:22,285 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-19 20:27:22,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:22,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:22,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:22,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:22,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:22,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:22,307 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 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:22,372 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-19 20:27:22,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:22,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:22,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:22,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:22,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:22,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:22,388 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:22,425 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-19 20:27:22,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:22,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:22,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:22,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:22,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:22,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:22,450 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:22,485 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-19 20:27:22,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:22,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:22,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:22,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:22,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:22,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:22,493 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 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:22,528 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-19 20:27:22,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:27:22,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:27:22,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:27:22,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:27:22,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:27:22,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:22,553 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:27:22,571 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-19 20:27:22,571 INFO L444 ModelExtractionUtils]: 6 out of 34 variables were initially zero. Simplification set additionally 25 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:27:22,577 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:27:22,608 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:27:22,609 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:27:22,609 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_7, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_7 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2020-10-19 20:27:22,866 INFO L297 tatePredicateManager]: 39 out of 42 supporting invariants were superfluous and have been removed [2020-10-19 20:27:22,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:27:22,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:22,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:27:22,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:23,010 WARN L261 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-19 20:27:23,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:23,052 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-19 20:27:23,052 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-19 20:27:23,052 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-10-19 20:27:23,112 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 46 states and 55 transitions. Complement of second has 7 states. [2020-10-19 20:27:23,114 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-19 20:27:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 20:27:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-10-19 20:27:23,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 32 letters. Loop has 3 letters. [2020-10-19 20:27:23,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:23,115 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 20:27:23,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:23,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:27:23,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:23,233 WARN L261 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-19 20:27:23,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:23,261 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-19 20:27:23,262 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2020-10-19 20:27:23,262 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-10-19 20:27:23,344 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 47 states and 56 transitions. Complement of second has 7 states. [2020-10-19 20:27:23,345 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-19 20:27:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 20:27:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2020-10-19 20:27:23,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 32 letters. Loop has 3 letters. [2020-10-19 20:27:23,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:23,346 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 20:27:23,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:27:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:23,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:27:23,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:27:23,472 WARN L261 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-19 20:27:23,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:27:23,503 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-19 20:27:23,504 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-10-19 20:27:23,504 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-10-19 20:27:23,557 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 42 states and 49 transitions. Complement of second has 6 states. [2020-10-19 20:27:23,559 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-19 20:27:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 20:27:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2020-10-19 20:27:23,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 32 letters. Loop has 3 letters. [2020-10-19 20:27:23,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:23,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 35 letters. Loop has 3 letters. [2020-10-19 20:27:23,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:23,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 32 letters. Loop has 6 letters. [2020-10-19 20:27:23,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:27:23,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2020-10-19 20:27:23,562 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 20:27:23,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2020-10-19 20:27:23,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 20:27:23,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 20:27:23,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 20:27:23,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:27:23,562 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:27:23,562 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:27:23,563 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:27:23,563 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-19 20:27:23,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 20:27:23,563 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 20:27:23,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 20:27:23,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 08:27:23 BoogieIcfgContainer [2020-10-19 20:27:23,569 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 20:27:23,569 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 20:27:23,569 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 20:27:23,569 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 20:27:23,570 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:26:15" (3/4) ... [2020-10-19 20:27:23,573 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 20:27:23,574 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 20:27:23,575 INFO L168 Benchmark]: Toolchain (without parser) took 69068.60 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 516.4 MB). Free memory was 960.0 MB in the beginning and 1.4 GB in the end (delta: -414.2 MB). Peak memory consumption was 102.2 MB. Max. memory is 11.5 GB. [2020-10-19 20:27:23,575 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:27:23,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 543.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2020-10-19 20:27:23,576 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:27:23,576 INFO L168 Benchmark]: Boogie Preprocessor took 32.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2020-10-19 20:27:23,576 INFO L168 Benchmark]: RCFGBuilder took 426.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2020-10-19 20:27:23,577 INFO L168 Benchmark]: BuchiAutomizer took 67997.45 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 384.3 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -287.8 MB). Peak memory consumption was 96.5 MB. Max. memory is 11.5 GB. [2020-10-19 20:27:23,577 INFO L168 Benchmark]: Witness Printer took 4.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:27:23,579 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 543.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 426.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 67997.45 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 384.3 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -287.8 MB). Peak memory consumption was 96.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 13 terminating modules (6 trivial, 4 deterministic, 3 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * i + -1 * nondetString2 and consists of 4 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * scanp and consists of 5 locations. One nondeterministic module has affine ranking function -1 * scanp + length2 and consists of 13 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * scanp and consists of 16 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * scanp and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 67.9s and 14 iterations. TraceHistogramMax:4. Analysis of lassos took 58.1s. Construction of modules took 1.3s. Büchi inclusion checks took 8.2s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 47 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 11. Nontrivial modules had stage [4, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 289 SDtfs, 724 SDslu, 841 SDs, 0 SdLazy, 1242 SolverSat, 202 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital371 mio100 ax106 hnf98 lsp90 ukn56 mio100 lsp48 div100 bol100 ite100 ukn100 eq186 hnf86 smp92 dnf220 smp91 tf100 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 85ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 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...