./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/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/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 5cff20f2f9db1407772cc4ac909fa32770d83e71 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:25:29,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 20:25:29,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 20:25:29,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 20:25:29,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 20:25:29,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 20:25:29,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 20:25:29,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 20:25:29,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 20:25:29,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 20:25:29,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 20:25:29,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 20:25:29,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 20:25:29,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 20:25:29,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 20:25:29,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 20:25:29,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 20:25:29,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 20:25:29,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 20:25:29,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 20:25:29,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 20:25:29,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 20:25:29,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 20:25:29,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 20:25:29,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 20:25:29,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 20:25:29,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 20:25:29,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 20:25:29,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 20:25:29,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 20:25:29,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 20:25:29,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 20:25:29,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 20:25:29,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 20:25:29,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 20:25:29,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 20:25:29,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 20:25:29,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 20:25:29,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 20:25:29,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 20:25:29,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 20:25:29,640 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:25:29,686 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 20:25:29,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 20:25:29,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 20:25:29,691 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 20:25:29,691 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 20:25:29,691 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 20:25:29,691 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 20:25:29,692 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 20:25:29,692 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 20:25:29,692 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 20:25:29,694 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 20:25:29,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 20:25:29,694 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 20:25:29,695 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 20:25:29,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 20:25:29,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 20:25:29,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 20:25:29,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 20:25:29,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 20:25:29,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 20:25:29,698 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 20:25:29,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 20:25:29,698 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 20:25:29,698 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 20:25:29,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 20:25:29,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 20:25:29,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 20:25:29,699 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 20:25:29,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 20:25:29,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 20:25:29,700 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 20:25:29,701 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 20:25:29,702 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 20:25:29,703 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 -> 5cff20f2f9db1407772cc4ac909fa32770d83e71 [2020-10-19 20:25:30,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 20:25:30,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 20:25:30,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 20:25:30,083 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 20:25:30,083 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 20:25:30,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2020-10-19 20:25:30,146 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e960a060c/c5d8ec615c6543d4983f50c43a6a68b2/FLAGe8f4eadcb [2020-10-19 20:25:30,643 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 20:25:30,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2020-10-19 20:25:30,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e960a060c/c5d8ec615c6543d4983f50c43a6a68b2/FLAGe8f4eadcb [2020-10-19 20:25:30,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e960a060c/c5d8ec615c6543d4983f50c43a6a68b2 [2020-10-19 20:25:30,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 20:25:30,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 20:25:30,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 20:25:30,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 20:25:30,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 20:25:30,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:25:30" (1/1) ... [2020-10-19 20:25:31,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4119a5a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:30, skipping insertion in model container [2020-10-19 20:25:31,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:25:30" (1/1) ... [2020-10-19 20:25:31,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 20:25:31,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 20:25:31,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:25:31,423 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 20:25:31,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:25:31,515 INFO L208 MainTranslator]: Completed translation [2020-10-19 20:25:31,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:31 WrapperNode [2020-10-19 20:25:31,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 20:25:31,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 20:25:31,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 20:25:31,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 20:25:31,526 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:25:31" (1/1) ... [2020-10-19 20:25:31,544 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:25:31" (1/1) ... [2020-10-19 20:25:31,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 20:25:31,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 20:25:31,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 20:25:31,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 20:25:31,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:31" (1/1) ... [2020-10-19 20:25:31,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:31" (1/1) ... [2020-10-19 20:25:31,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:31" (1/1) ... [2020-10-19 20:25:31,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:31" (1/1) ... [2020-10-19 20:25:31,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:31" (1/1) ... [2020-10-19 20:25:31,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:31" (1/1) ... [2020-10-19 20:25:31,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:31" (1/1) ... [2020-10-19 20:25:31,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 20:25:31,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 20:25:31,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 20:25:31,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 20:25:31,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:31" (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:25:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 20:25:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 20:25:31,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 20:25:31,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 20:25:31,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 20:25:31,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 20:25:32,001 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 20:25:32,001 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-19 20:25:32,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:25:32 BoogieIcfgContainer [2020-10-19 20:25:32,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 20:25:32,004 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 20:25:32,004 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 20:25:32,008 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 20:25:32,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:25:32,009 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 08:25:30" (1/3) ... [2020-10-19 20:25:32,010 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ba1e48a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:25:32, skipping insertion in model container [2020-10-19 20:25:32,010 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:25:32,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:25:31" (2/3) ... [2020-10-19 20:25:32,011 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ba1e48a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:25:32, skipping insertion in model container [2020-10-19 20:25:32,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:25:32,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:25:32" (3/3) ... [2020-10-19 20:25:32,013 INFO L373 chiAutomizerObserver]: Analyzing ICFG cstrpbrk-alloca-2.i [2020-10-19 20:25:32,074 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 20:25:32,075 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 20:25:32,075 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 20:25:32,075 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 20:25:32,075 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 20:25:32,076 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 20:25:32,076 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 20:25:32,076 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 20:25:32,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-10-19 20:25:32,116 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2020-10-19 20:25:32,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:32,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:32,122 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 20:25:32,122 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:25:32,122 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 20:25:32,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-10-19 20:25:32,125 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2020-10-19 20:25:32,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:32,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:32,126 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 20:25:32,126 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:25:32,132 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 14#L532true assume !(main_~length1~0 < 1); 18#L532-2true assume !(main_~length2~0 < 1); 9#L535-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 25#L541-3true [2020-10-19 20:25:32,133 INFO L796 eck$LassoCheckResult]: Loop: 25#L541-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 22#L541-2true main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 25#L541-3true [2020-10-19 20:25:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:32,139 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-10-19 20:25:32,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:32,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572095479] [2020-10-19 20:25:32,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:32,257 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:32,272 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:32,298 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:32,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:32,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2020-10-19 20:25:32,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:32,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50970829] [2020-10-19 20:25:32,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:32,311 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:32,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:32,321 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:32,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:32,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2020-10-19 20:25:32,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:32,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043255613] [2020-10-19 20:25:32,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:32,353 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:32,372 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:32,378 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:32,638 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-10-19 20:25:32,733 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:32,734 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:32,735 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:32,735 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:32,735 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:32,736 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:32,736 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:32,736 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:32,736 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration1_Lasso [2020-10-19 20:25:32,737 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:32,737 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:32,763 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:25:32,777 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:25:32,781 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:25:32,784 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:25:32,788 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:25:32,957 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:25:32,961 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:25:32,966 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:25:32,969 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:25:32,973 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:25:32,981 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:25:32,984 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:25:32,988 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:25:32,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:25:32,996 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:25:33,000 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:25:33,331 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:25:33,338 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:33,346 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:25:33,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:33,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:33,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:33,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:33,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:33,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:33,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:33,360 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:25:33,412 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:25:33,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:33,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:33,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:33,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:33,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:33,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:33,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:33,419 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) [2020-10-19 20:25:33,460 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:25:33,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:33,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:33,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:33,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:33,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:33,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:33,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:33,471 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:25:33,499 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:25:33,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:33,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:33,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:33,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:33,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:33,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:33,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:33,505 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) [2020-10-19 20:25:33,542 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:25:33,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:33,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:33,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:33,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:33,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:33,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:33,559 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:25:33,603 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:25:33,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:33,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:33,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:33,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:33,610 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:33,611 INFO L402 nArgumentSynthesizer]: A total of 2 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:25:33,616 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:25:33,667 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:25:33,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:33,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:33,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:33,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:33,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:33,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:33,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:33,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:33,724 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:25:33,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:33,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:33,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:33,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:33,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:33,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:33,754 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:25:33,780 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-19 20:25:33,780 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:33,786 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:33,795 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:25:33,796 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:25:33,796 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:25:33,854 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-10-19 20:25:33,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:33,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:25:33,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:33,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:25:33,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:33,958 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:25:33,978 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:25:33,980 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2020-10-19 20:25:34,059 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 60 states and 87 transitions. Complement of second has 7 states. [2020-10-19 20:25:34,060 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:25:34,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 20:25:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2020-10-19 20:25:34,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-19 20:25:34,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:34,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 7 letters. Loop has 2 letters. [2020-10-19 20:25:34,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:34,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 4 letters. [2020-10-19 20:25:34,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:34,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. [2020-10-19 20:25:34,075 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-19 20:25:34,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 27 transitions. [2020-10-19 20:25:34,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 20:25:34,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-19 20:25:34,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2020-10-19 20:25:34,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:25:34,083 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-10-19 20:25:34,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2020-10-19 20:25:34,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-19 20:25:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-19 20:25:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2020-10-19 20:25:34,115 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-10-19 20:25:34,115 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-10-19 20:25:34,115 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 20:25:34,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2020-10-19 20:25:34,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-19 20:25:34,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:34,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:34,117 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:34,117 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 20:25:34,118 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 167#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 168#L532 assume !(main_~length1~0 < 1); 169#L532-2 assume !(main_~length2~0 < 1); 163#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 164#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 160#L541-4 main_~i~1 := 0; 161#L546-3 [2020-10-19 20:25:34,118 INFO L796 eck$LassoCheckResult]: Loop: 161#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 165#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 161#L546-3 [2020-10-19 20:25:34,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:34,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2020-10-19 20:25:34,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:34,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61335464] [2020-10-19 20:25:34,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:34,132 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:34,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:34,148 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:34,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:34,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2020-10-19 20:25:34,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:34,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481064286] [2020-10-19 20:25:34,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:34,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:34,163 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:34,165 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:34,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:34,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2020-10-19 20:25:34,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:34,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877895074] [2020-10-19 20:25:34,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:34,183 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:34,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:34,203 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:34,390 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-10-19 20:25:34,458 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:34,458 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:34,458 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:34,459 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:34,459 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:34,459 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:34,459 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:34,459 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:34,459 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration2_Lasso [2020-10-19 20:25:34,460 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:34,460 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:34,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:25:34,468 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:25:34,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:25:34,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:25:34,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:25:34,481 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:25:34,484 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:25:34,491 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:25:34,495 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:25:34,499 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:25:34,502 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:25:34,505 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:25:34,509 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:25:34,659 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:25:34,662 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:25:34,985 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:25:34,985 INFO L489 LassoAnalysis]: Using template 'affine'. 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:25:34,989 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:34,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:34,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:34,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:34,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:34,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:34,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:34,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:34,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:35,028 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:25:35,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:35,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:35,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:35,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:35,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:35,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:35,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:35,032 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:35,055 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:25:35,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:35,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:35,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:35,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:35,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:35,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:35,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:35,071 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:25:35,098 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:25:35,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:35,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:35,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:35,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:35,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:35,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:35,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:35,104 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) [2020-10-19 20:25:35,148 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:25:35,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:35,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:35,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:35,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:35,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:35,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:35,157 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:25:35,187 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:25:35,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:35,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:35,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:35,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:35,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:35,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:35,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:35,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 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:25:35,222 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:25:35,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:35,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:35,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:35,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:35,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:35,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:35,231 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) [2020-10-19 20:25:35,278 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:25:35,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:35,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:35,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:35,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:35,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:35,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:35,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:35,341 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:25:35,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:35,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:35,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:35,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:35,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:35,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:35,354 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:25:35,394 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:25:35,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:35,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:35,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:35,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:35,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:35,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:35,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:35,399 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:25:35,423 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:25:35,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:35,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:35,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:35,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:35,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:35,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:35,432 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:25:35,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:25:35,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:35,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:35,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:35,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:35,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:35,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:35,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:35,527 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:25:35,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:35,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:35,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:35,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:35,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:35,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:35,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:35,574 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:25:35,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:35,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:35,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:35,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:35,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:35,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:35,596 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:25:35,708 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-10-19 20:25:35,708 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:35,710 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:25:35,712 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 20:25:35,713 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:25:35,713 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) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_main_~i~1 Supporting invariants [1*ULTIMATE.start_main_~nondetString2~0.offset >= 0] [2020-10-19 20:25:35,755 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2020-10-19 20:25:35,758 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:25:35,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:35,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:25:35,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:35,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 20:25:35,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:35,840 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:25:35,840 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:25:35,841 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 4 states. [2020-10-19 20:25:35,907 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 31 states and 44 transitions. Complement of second has 7 states. [2020-10-19 20:25:35,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:25:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 20:25:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-10-19 20:25:35,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2020-10-19 20:25:35,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:35,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2020-10-19 20:25:35,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:35,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2020-10-19 20:25:35,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:35,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2020-10-19 20:25:35,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 20:25:35,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2020-10-19 20:25:35,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-19 20:25:35,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-19 20:25:35,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2020-10-19 20:25:35,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:25:35,914 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-10-19 20:25:35,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2020-10-19 20:25:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-19 20:25:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-19 20:25:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2020-10-19 20:25:35,916 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-10-19 20:25:35,917 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-10-19 20:25:35,917 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 20:25:35,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2020-10-19 20:25:35,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 20:25:35,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:35,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:35,918 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:35,918 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:35,919 INFO L794 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 304#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 305#L532 assume !(main_~length1~0 < 1); 306#L532-2 assume !(main_~length2~0 < 1); 299#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 300#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 296#L541-4 main_~i~1 := 0; 297#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 303#L546-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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 293#L519-4 [2020-10-19 20:25:35,919 INFO L796 eck$LassoCheckResult]: Loop: 293#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 298#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 310#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 307#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 308#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 294#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 295#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 292#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 293#L519-4 [2020-10-19 20:25:35,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:35,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2020-10-19 20:25:35,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:35,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462666681] [2020-10-19 20:25:35,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:35,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:35,964 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:35,972 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:35,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:35,972 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 1 times [2020-10-19 20:25:35,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:35,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144733319] [2020-10-19 20:25:35,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:35,989 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:36,002 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:36,006 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:36,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:36,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1903570310, now seen corresponding path program 1 times [2020-10-19 20:25:36,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:36,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591018886] [2020-10-19 20:25:36,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:36,303 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:25:36,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591018886] [2020-10-19 20:25:36,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:25:36,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-19 20:25:36,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341568919] [2020-10-19 20:25:36,454 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-10-19 20:25:36,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:36,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-19 20:25:36,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-19 20:25:36,517 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 11 Second operand 10 states. [2020-10-19 20:25:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:36,878 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2020-10-19 20:25:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-19 20:25:36,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2020-10-19 20:25:36,884 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-10-19 20:25:36,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 48 states and 64 transitions. [2020-10-19 20:25:36,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-10-19 20:25:36,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-10-19 20:25:36,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2020-10-19 20:25:36,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:25:36,894 INFO L691 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2020-10-19 20:25:36,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2020-10-19 20:25:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2020-10-19 20:25:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-19 20:25:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2020-10-19 20:25:36,902 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-10-19 20:25:36,902 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-10-19 20:25:36,902 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 20:25:36,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2020-10-19 20:25:36,903 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-19 20:25:36,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:36,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:36,903 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:36,904 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:36,904 INFO L794 eck$LassoCheckResult]: Stem: 413#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 407#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 408#L532 assume !(main_~length1~0 < 1); 409#L532-2 assume !(main_~length2~0 < 1); 401#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 402#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 419#L541-4 main_~i~1 := 0; 405#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 406#L546-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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 423#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 422#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 415#L522-5 [2020-10-19 20:25:36,907 INFO L796 eck$LassoCheckResult]: Loop: 415#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 420#L522-1 assume !cstrpbrk_#t~short7; 421#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 415#L522-5 [2020-10-19 20:25:36,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:36,907 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759941, now seen corresponding path program 1 times [2020-10-19 20:25:36,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:36,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615452774] [2020-10-19 20:25:36,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:37,073 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:25:37,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615452774] [2020-10-19 20:25:37,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:25:37,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-19 20:25:37,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001159494] [2020-10-19 20:25:37,074 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:25:37,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:37,075 INFO L82 PathProgramCache]: Analyzing trace with hash 86558, now seen corresponding path program 1 times [2020-10-19 20:25:37,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:37,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093338042] [2020-10-19 20:25:37,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:37,086 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:25:37,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093338042] [2020-10-19 20:25:37,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:25:37,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 20:25:37,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962943964] [2020-10-19 20:25:37,087 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:25:37,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:37,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:25:37,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:25:37,088 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand 3 states. [2020-10-19 20:25:37,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:37,098 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2020-10-19 20:25:37,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:25:37,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 44 transitions. [2020-10-19 20:25:37,100 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-19 20:25:37,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 44 transitions. [2020-10-19 20:25:37,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-10-19 20:25:37,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-10-19 20:25:37,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2020-10-19 20:25:37,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:25:37,102 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-10-19 20:25:37,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2020-10-19 20:25:37,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-10-19 20:25:37,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-19 20:25:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-10-19 20:25:37,106 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-10-19 20:25:37,106 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-10-19 20:25:37,106 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 20:25:37,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2020-10-19 20:25:37,107 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-19 20:25:37,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:37,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:37,107 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:37,108 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:37,108 INFO L794 eck$LassoCheckResult]: Stem: 489#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 483#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 484#L532 assume !(main_~length1~0 < 1); 485#L532-2 assume !(main_~length2~0 < 1); 478#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 479#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 493#L541-4 main_~i~1 := 0; 501#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 498#L546-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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 476#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 477#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 490#L522-5 [2020-10-19 20:25:37,108 INFO L796 eck$LassoCheckResult]: Loop: 490#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 486#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 487#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 490#L522-5 [2020-10-19 20:25:37,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:37,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759941, now seen corresponding path program 2 times [2020-10-19 20:25:37,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:37,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137187639] [2020-10-19 20:25:37,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:37,276 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:25:37,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137187639] [2020-10-19 20:25:37,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:25:37,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-19 20:25:37,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430620653] [2020-10-19 20:25:37,277 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:25:37,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:37,277 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 1 times [2020-10-19 20:25:37,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:37,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850884088] [2020-10-19 20:25:37,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:37,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:37,288 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:37,290 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:37,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:37,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 20:25:37,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-19 20:25:37,383 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 16 Second operand 7 states. [2020-10-19 20:25:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:37,452 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-10-19 20:25:37,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 20:25:37,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2020-10-19 20:25:37,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-10-19 20:25:37,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 23 states and 30 transitions. [2020-10-19 20:25:37,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-19 20:25:37,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-19 20:25:37,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2020-10-19 20:25:37,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:25:37,455 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-10-19 20:25:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2020-10-19 20:25:37,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-10-19 20:25:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-19 20:25:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2020-10-19 20:25:37,458 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-10-19 20:25:37,458 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-10-19 20:25:37,458 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 20:25:37,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2020-10-19 20:25:37,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-10-19 20:25:37,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:37,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:37,460 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:37,460 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:37,461 INFO L794 eck$LassoCheckResult]: Stem: 564#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 558#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 559#L532 assume !(main_~length1~0 < 1); 560#L532-2 assume !(main_~length2~0 < 1); 553#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 554#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 566#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 567#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 550#L541-4 main_~i~1 := 0; 551#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 557#L546-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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 547#L519-4 [2020-10-19 20:25:37,461 INFO L796 eck$LassoCheckResult]: Loop: 547#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 552#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 565#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 561#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 562#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 548#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 549#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 546#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 547#L519-4 [2020-10-19 20:25:37,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:37,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2020-10-19 20:25:37,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:37,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435790483] [2020-10-19 20:25:37,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:37,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:37,485 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:37,490 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:37,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 2 times [2020-10-19 20:25:37,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:37,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987820037] [2020-10-19 20:25:37,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:37,499 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:37,505 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:37,508 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:37,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:37,509 INFO L82 PathProgramCache]: Analyzing trace with hash -164170776, now seen corresponding path program 1 times [2020-10-19 20:25:37,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:37,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619531399] [2020-10-19 20:25:37,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:37,721 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:25:37,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619531399] [2020-10-19 20:25:37,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:25:37,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-19 20:25:37,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506541555] [2020-10-19 20:25:37,867 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-10-19 20:25:37,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:37,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-19 20:25:37,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-19 20:25:37,936 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 10 Second operand 10 states. [2020-10-19 20:25:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:38,187 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-10-19 20:25:38,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 20:25:38,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2020-10-19 20:25:38,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2020-10-19 20:25:38,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 36 states and 45 transitions. [2020-10-19 20:25:38,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-10-19 20:25:38,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-10-19 20:25:38,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2020-10-19 20:25:38,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:25:38,191 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2020-10-19 20:25:38,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2020-10-19 20:25:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-10-19 20:25:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-19 20:25:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2020-10-19 20:25:38,196 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-10-19 20:25:38,196 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-10-19 20:25:38,196 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 20:25:38,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. [2020-10-19 20:25:38,197 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2020-10-19 20:25:38,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:38,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:38,199 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:38,199 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:38,199 INFO L794 eck$LassoCheckResult]: Stem: 653#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 647#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 648#L532 assume !(main_~length1~0 < 1); 649#L532-2 assume !(main_~length2~0 < 1); 641#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 642#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 658#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 659#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 636#L541-4 main_~i~1 := 0; 637#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 645#L546-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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 635#L519-4 [2020-10-19 20:25:38,199 INFO L796 eck$LassoCheckResult]: Loop: 635#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 638#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 662#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 661#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 654#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 655#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 666#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 664#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 632#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 633#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 634#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 635#L519-4 [2020-10-19 20:25:38,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:38,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 2 times [2020-10-19 20:25:38,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:38,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346892768] [2020-10-19 20:25:38,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:38,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:38,222 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:38,228 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:38,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:38,229 INFO L82 PathProgramCache]: Analyzing trace with hash -898285594, now seen corresponding path program 1 times [2020-10-19 20:25:38,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:38,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186730931] [2020-10-19 20:25:38,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:38,238 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:38,245 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:38,249 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:38,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:38,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1809250353, now seen corresponding path program 1 times [2020-10-19 20:25:38,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:38,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524370798] [2020-10-19 20:25:38,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:25:38,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524370798] [2020-10-19 20:25:38,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203034369] [2020-10-19 20:25:38,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:25:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:38,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-19 20:25:38,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:38,518 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:25:38,519 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:25:38,519 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:25:38,532 INFO L625 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2020-10-19 20:25:38,536 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:25:38,536 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:5 [2020-10-19 20:25:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:25:38,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-19 20:25:38,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2020-10-19 20:25:38,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108774617] [2020-10-19 20:25:38,888 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2020-10-19 20:25:38,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:38,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-19 20:25:38,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-19 20:25:38,971 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. cyclomatic complexity: 13 Second operand 9 states. [2020-10-19 20:25:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:39,142 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-10-19 20:25:39,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 20:25:39,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2020-10-19 20:25:39,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-10-19 20:25:39,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 23 states and 29 transitions. [2020-10-19 20:25:39,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-19 20:25:39,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-19 20:25:39,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2020-10-19 20:25:39,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:25:39,145 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-10-19 20:25:39,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2020-10-19 20:25:39,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-10-19 20:25:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-19 20:25:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2020-10-19 20:25:39,147 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-10-19 20:25:39,147 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-10-19 20:25:39,147 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 20:25:39,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2020-10-19 20:25:39,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-10-19 20:25:39,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:39,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:39,148 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:39,149 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:39,149 INFO L794 eck$LassoCheckResult]: Stem: 808#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 802#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 803#L532 assume !(main_~length1~0 < 1); 804#L532-2 assume !(main_~length2~0 < 1); 797#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 798#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 810#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 811#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 794#L541-4 main_~i~1 := 0; 795#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 799#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 800#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 801#L546-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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 793#L519-4 [2020-10-19 20:25:39,149 INFO L796 eck$LassoCheckResult]: Loop: 793#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 796#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 809#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 805#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 806#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 790#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 791#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 792#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 793#L519-4 [2020-10-19 20:25:39,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:39,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2020-10-19 20:25:39,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:39,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679912836] [2020-10-19 20:25:39,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:39,160 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:39,169 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:39,174 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:39,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:39,175 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 3 times [2020-10-19 20:25:39,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:39,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051659940] [2020-10-19 20:25:39,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:39,180 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:39,185 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:39,187 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:39,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1875279350, now seen corresponding path program 1 times [2020-10-19 20:25:39,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:39,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414001540] [2020-10-19 20:25:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:39,201 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:39,217 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:39,225 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:39,362 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-10-19 20:25:39,976 WARN L193 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 115 [2020-10-19 20:25:40,206 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-19 20:25:40,209 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:40,209 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:40,209 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:40,209 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:40,209 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:40,209 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:40,209 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:40,210 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:40,210 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration8_Lasso [2020-10-19 20:25:40,210 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:40,210 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:40,215 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:25:40,219 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:25:40,225 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:25:40,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:40,233 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:25:40,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:40,238 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:25:40,241 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:25:40,714 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2020-10-19 20:25:40,935 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2020-10-19 20:25:40,937 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:25:40,939 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:25:40,942 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:25:40,944 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:25:40,947 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:25:40,949 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:25:40,951 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:25:40,956 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:25:40,959 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:25:40,960 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:25:40,962 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:25:40,964 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:25:40,966 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:25:40,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:25:40,973 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:25:40,976 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:25:40,980 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:25:40,981 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:25:40,984 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:25:41,220 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-10-19 20:25:41,856 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2020-10-19 20:25:41,925 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:25:41,926 INFO L489 LassoAnalysis]: Using template 'affine'. 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:25:41,945 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:41,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:41,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:41,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:41,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:41,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:41,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:41,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:41,951 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:25:41,989 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:25:41,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:41,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:41,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:41,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:41,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:41,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:41,994 INFO L402 nArgumentSynthesizer]: A total of 0 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:25:41,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:42,032 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:25:42,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:42,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:42,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:42,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:42,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:42,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:42,035 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:25:42,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:42,073 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:25:42,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:42,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:42,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:42,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:42,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:42,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:42,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:42,076 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:25:42,098 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:25:42,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:42,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:42,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:42,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:42,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:42,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:42,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:42,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:42,128 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:25:42,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:42,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:42,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:42,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:42,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:42,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:42,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:42,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:42,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:25:42,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:42,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:42,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:42,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:42,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:42,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:42,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:42,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:42,180 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:25:42,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:42,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:42,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:42,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:42,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:42,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:42,186 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:25:42,214 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:25:42,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:42,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:42,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:42,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:42,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:42,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:42,260 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:25:42,441 INFO L443 ModelExtractionUtils]: Simplification made 34 calls to the SMT solver. [2020-10-19 20:25:42,441 INFO L444 ModelExtractionUtils]: 14 out of 61 variables were initially zero. Simplification set additionally 44 variables to zero. 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) [2020-10-19 20:25:42,447 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:42,451 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:25:42,451 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:25:42,451 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2 Supporting invariants [] [2020-10-19 20:25:42,559 INFO L297 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2020-10-19 20:25:42,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:25:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:42,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:25:42,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:42,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:25:42,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:42,662 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:25:42,662 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:25:42,663 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-19 20:25:42,729 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 31 states and 40 transitions. Complement of second has 5 states. [2020-10-19 20:25:42,730 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:25:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 20:25:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2020-10-19 20:25:42,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 8 letters. [2020-10-19 20:25:42,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:42,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 8 letters. [2020-10-19 20:25:42,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:42,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 16 letters. [2020-10-19 20:25:42,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:42,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2020-10-19 20:25:42,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:42,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 35 transitions. [2020-10-19 20:25:42,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-19 20:25:42,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 20:25:42,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2020-10-19 20:25:42,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:42,736 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-10-19 20:25:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2020-10-19 20:25:42,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-10-19 20:25:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-19 20:25:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2020-10-19 20:25:42,743 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-10-19 20:25:42,743 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-10-19 20:25:42,744 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 20:25:42,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2020-10-19 20:25:42,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:42,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:42,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:42,746 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:42,747 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:42,747 INFO L794 eck$LassoCheckResult]: Stem: 1024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1016#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1017#L532 assume !(main_~length1~0 < 1); 1018#L532-2 assume !(main_~length2~0 < 1); 1011#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1012#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1027#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1028#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1006#L541-4 main_~i~1 := 0; 1007#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1013#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1014#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1015#L546-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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 1008#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1010#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1025#L522-5 [2020-10-19 20:25:42,747 INFO L796 eck$LassoCheckResult]: Loop: 1025#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1019#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1020#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 1025#L522-5 [2020-10-19 20:25:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:42,748 INFO L82 PathProgramCache]: Analyzing trace with hash 2055034687, now seen corresponding path program 1 times [2020-10-19 20:25:42,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:42,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949319874] [2020-10-19 20:25:42,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:42,777 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:42,796 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:42,808 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:42,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:42,808 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 2 times [2020-10-19 20:25:42,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:42,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266656854] [2020-10-19 20:25:42,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:42,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:42,822 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:42,824 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:42,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:42,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1074579938, now seen corresponding path program 1 times [2020-10-19 20:25:42,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:42,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174838676] [2020-10-19 20:25:42,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:42,848 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:42,898 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:42,905 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:43,892 WARN L193 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 129 [2020-10-19 20:25:44,163 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-19 20:25:44,165 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:44,165 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:44,165 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:44,165 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:44,165 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:44,165 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:44,165 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:44,165 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:44,165 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration9_Lasso [2020-10-19 20:25:44,166 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:44,166 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:44,169 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:25:44,177 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:25:44,179 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:25:44,182 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:25:44,184 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:25:44,186 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:25:44,193 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:25:44,195 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:25:44,197 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:25:44,200 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:25:44,202 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:25:44,205 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:25:44,207 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:25:44,210 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:25:44,212 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:25:44,215 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:25:44,216 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:25:44,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:25:44,747 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2020-10-19 20:25:44,914 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2020-10-19 20:25:44,915 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:25:44,917 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:25:44,920 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:25:44,922 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:25:44,923 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:25:44,925 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:25:44,927 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:25:44,928 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:25:44,931 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:25:45,162 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2020-10-19 20:25:45,939 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-10-19 20:25:46,030 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:25:46,031 INFO L489 LassoAnalysis]: Using template 'affine'. 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:25:46,035 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:25:46,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:46,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:46,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:46,038 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:46,062 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:25:46,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:46,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:46,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:46,070 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:25:46,091 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:25:46,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:46,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:46,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:46,095 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:25:46,118 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:25:46,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:46,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:46,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:46,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:46,150 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:25:46,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:46,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:46,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:46,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 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:25:46,181 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:25:46,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:46,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:46,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:46,186 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:25:46,209 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:25:46,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,212 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:46,212 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:46,215 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) [2020-10-19 20:25:46,238 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:25:46,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:46,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:46,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:46,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:46,264 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:25:46,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:46,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:46,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:46,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:46,289 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:25:46,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:46,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:46,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:46,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:46,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:46,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:46,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:46,322 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:25:46,347 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:25:46,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:46,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:46,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:46,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:46,396 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:25:46,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:46,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:46,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:46,401 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:25:46,433 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:25:46,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:46,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:46,439 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:25:46,461 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:25:46,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:46,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:46,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:46,465 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:25:46,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:46,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:46,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:46,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:46,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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:46,517 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:46,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:25:46,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:25:46,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:25:46,520 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:46,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:25:46,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:46,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:46,550 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:46,575 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:25:46,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:46,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:46,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:46,605 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:25:46,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:25:46,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:25:46,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:25:46,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:25:46,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:25:46,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:25:46,646 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:25:46,683 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-19 20:25:46,683 INFO L444 ModelExtractionUtils]: 40 out of 58 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:25:46,688 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:46,692 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:25:46,692 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:25:46,692 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_4) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_4 Supporting invariants [] [2020-10-19 20:25:46,832 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2020-10-19 20:25:46,834 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:25:46,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:46,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:25:46,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:46,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 20:25:46,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:46,939 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:25:46,940 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:25:46,940 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-19 20:25:47,020 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 54 states and 67 transitions. Complement of second has 7 states. [2020-10-19 20:25:47,023 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:25:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 20:25:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2020-10-19 20:25:47,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-19 20:25:47,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:47,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 18 letters. Loop has 3 letters. [2020-10-19 20:25:47,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:47,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 6 letters. [2020-10-19 20:25:47,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:25:47,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 67 transitions. [2020-10-19 20:25:47,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:47,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 40 states and 50 transitions. [2020-10-19 20:25:47,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-19 20:25:47,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-19 20:25:47,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 50 transitions. [2020-10-19 20:25:47,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:47,028 INFO L691 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2020-10-19 20:25:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 50 transitions. [2020-10-19 20:25:47,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2020-10-19 20:25:47,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-19 20:25:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2020-10-19 20:25:47,030 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2020-10-19 20:25:47,030 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2020-10-19 20:25:47,031 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 20:25:47,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2020-10-19 20:25:47,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:47,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:47,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:47,032 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:47,032 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:47,032 INFO L794 eck$LassoCheckResult]: Stem: 1296#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1289#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1290#L532 assume !(main_~length1~0 < 1); 1291#L532-2 assume !(main_~length2~0 < 1); 1284#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1285#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1299#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1300#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1278#L541-4 main_~i~1 := 0; 1279#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1286#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1287#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1288#L546-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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 1280#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1281#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1298#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1294#L522-1 assume !cstrpbrk_#t~short7; 1295#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 1274#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 1275#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 1276#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 1277#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1283#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1297#L522-5 [2020-10-19 20:25:47,032 INFO L796 eck$LassoCheckResult]: Loop: 1297#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1292#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1293#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 1297#L522-5 [2020-10-19 20:25:47,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:47,033 INFO L82 PathProgramCache]: Analyzing trace with hash -777149455, now seen corresponding path program 1 times [2020-10-19 20:25:47,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:47,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376607590] [2020-10-19 20:25:47,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-19 20:25:47,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376607590] [2020-10-19 20:25:47,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:25:47,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-19 20:25:47,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657552592] [2020-10-19 20:25:47,083 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:25:47,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:47,083 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 3 times [2020-10-19 20:25:47,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:47,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208297755] [2020-10-19 20:25:47,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:47,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:47,090 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:47,091 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:47,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:47,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 20:25:47,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-19 20:25:47,193 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand 7 states. [2020-10-19 20:25:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:47,291 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2020-10-19 20:25:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 20:25:47,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2020-10-19 20:25:47,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:47,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 39 transitions. [2020-10-19 20:25:47,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 20:25:47,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 20:25:47,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2020-10-19 20:25:47,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:47,296 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-10-19 20:25:47,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2020-10-19 20:25:47,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-19 20:25:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-19 20:25:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-10-19 20:25:47,299 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-10-19 20:25:47,299 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-10-19 20:25:47,299 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 20:25:47,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2020-10-19 20:25:47,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:47,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:47,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:47,300 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:47,300 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:47,301 INFO L794 eck$LassoCheckResult]: Stem: 1381#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1374#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1375#L532 assume !(main_~length1~0 < 1); 1376#L532-2 assume !(main_~length2~0 < 1); 1369#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1370#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1386#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1387#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1363#L541-4 main_~i~1 := 0; 1364#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1371#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1372#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1373#L546-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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 1365#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1366#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1384#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1390#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1388#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 1361#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 1362#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 1359#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 1360#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1368#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1382#L522-5 [2020-10-19 20:25:47,301 INFO L796 eck$LassoCheckResult]: Loop: 1382#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1377#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1378#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 1382#L522-5 [2020-10-19 20:25:47,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:47,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1742810479, now seen corresponding path program 2 times [2020-10-19 20:25:47,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:47,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94201442] [2020-10-19 20:25:47,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:25:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 20:25:47,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94201442] [2020-10-19 20:25:47,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326887012] [2020-10-19 20:25:47,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 20:25:47,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 20:25:47,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 20:25:47,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 40 conjunts are in the unsatisfiable core [2020-10-19 20:25:47,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:25:47,839 INFO L350 Elim1Store]: treesize reduction 38, result has 20.8 percent of original size [2020-10-19 20:25:47,840 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 35 treesize of output 20 [2020-10-19 20:25:47,840 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:25:47,857 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:25:47,863 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:25:47,863 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:41 [2020-10-19 20:25:48,059 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:25:48,059 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:25:48,061 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:25:48,062 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:25:48,062 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-10-19 20:25:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:25:48,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 20:25:48,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 18 [2020-10-19 20:25:48,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93383806] [2020-10-19 20:25:48,066 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:25:48,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:48,066 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 4 times [2020-10-19 20:25:48,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:48,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354699676] [2020-10-19 20:25:48,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:48,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:48,073 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:48,075 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:48,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:25:48,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-19 20:25:48,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2020-10-19 20:25:48,174 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand 19 states. [2020-10-19 20:25:49,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:25:49,214 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2020-10-19 20:25:49,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-19 20:25:49,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 80 transitions. [2020-10-19 20:25:49,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:49,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 35 states and 42 transitions. [2020-10-19 20:25:49,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 20:25:49,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 20:25:49,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2020-10-19 20:25:49,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:25:49,217 INFO L691 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-19 20:25:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2020-10-19 20:25:49,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-10-19 20:25:49,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-19 20:25:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2020-10-19 20:25:49,220 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2020-10-19 20:25:49,220 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2020-10-19 20:25:49,220 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 20:25:49,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2020-10-19 20:25:49,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:25:49,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:25:49,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:25:49,221 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:25:49,221 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:25:49,222 INFO L794 eck$LassoCheckResult]: Stem: 1599#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1592#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1593#L532 assume !(main_~length1~0 < 1); 1594#L532-2 assume !(main_~length2~0 < 1); 1587#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1588#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1604#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1605#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1607#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1609#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1581#L541-4 main_~i~1 := 0; 1582#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1589#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1590#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1591#L546-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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 1583#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1584#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1602#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1597#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1598#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 1577#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 1578#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 1579#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 1580#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1586#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1600#L522-5 [2020-10-19 20:25:49,222 INFO L796 eck$LassoCheckResult]: Loop: 1600#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1595#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1596#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 1600#L522-5 [2020-10-19 20:25:49,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:49,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1365761455, now seen corresponding path program 3 times [2020-10-19 20:25:49,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:49,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321055964] [2020-10-19 20:25:49,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:49,239 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:49,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:49,257 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:49,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:49,258 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 5 times [2020-10-19 20:25:49,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:49,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884982422] [2020-10-19 20:25:49,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:49,261 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:49,263 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:49,265 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:49,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:25:49,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1174254192, now seen corresponding path program 1 times [2020-10-19 20:25:49,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:25:49,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032674013] [2020-10-19 20:25:49,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:25:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:49,281 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:25:49,296 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:25:49,302 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:25:51,509 WARN L193 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 228 DAG size of output: 178 [2020-10-19 20:25:59,859 WARN L193 SmtUtils]: Spent 8.34 s on a formula simplification. DAG size of input: 156 DAG size of output: 156 [2020-10-19 20:25:59,864 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:25:59,864 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:25:59,864 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:25:59,864 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:25:59,864 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:25:59,864 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:25:59,864 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:25:59,864 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:25:59,864 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration12_Lasso [2020-10-19 20:25:59,864 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:25:59,865 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:25:59,875 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:25:59,886 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:25:59,889 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:25:59,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:25:59,894 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:25:59,896 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:25:59,899 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:25:59,901 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:25:59,904 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:25:59,907 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:25:59,910 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:25:59,913 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:00,699 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-10-19 20:26:02,001 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 139 DAG size of output: 113 [2020-10-19 20:26:02,259 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2020-10-19 20:26:02,260 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:02,263 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:02,266 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:02,269 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:02,271 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:02,273 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:02,277 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:02,280 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:02,282 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:02,285 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:02,287 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:02,290 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:02,299 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:02,301 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:02,304 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:02,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:02,681 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2020-10-19 20:26:02,954 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-19 20:26:03,051 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-10-19 20:26:03,741 WARN L193 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2020-10-19 20:26:04,054 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-10-19 20:26:04,297 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-19 20:26:04,396 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:26:04,397 INFO L489 LassoAnalysis]: Using template 'affine'. 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:04,403 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:04,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:04,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:04,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:04,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:04,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:04,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:04,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:04,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 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:04,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:04,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:04,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:04,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:04,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:04,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:04,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:04,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:04,432 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:04,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 20:26:04,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:04,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:04,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:04,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:04,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:04,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:04,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:04,458 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:04,482 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:04,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:04,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:04,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:04,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:04,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:04,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:04,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:04,485 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:04,509 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:04,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:04,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:04,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:04,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:04,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:04,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:04,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:04,512 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:04,536 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:04,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:04,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:04,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:04,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:04,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:04,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:04,541 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:04,563 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:04,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:04,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:04,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:04,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:04,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:04,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:04,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:04,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04,590 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:04,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:04,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:04,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:04,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:04,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:04,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:04,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:04,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04,622 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:04,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:04,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:04,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:04,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:04,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:04,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:04,629 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:04,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:04,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:04,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:04,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:04,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:04,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:04,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:04,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:04,654 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:04,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:04,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:04,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:04,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:04,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:04,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:04,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:04,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:04,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04,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:04,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:04,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:04,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:04,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:04,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:04,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:04,718 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:04,742 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:04,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:04,744 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-10-19 20:26:04,744 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2020-10-19 20:26:04,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:04,849 INFO L401 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2020-10-19 20:26:04,850 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2020-10-19 20:26:05,247 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) [2020-10-19 20:26:05,287 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:05,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:05,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:05,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:05,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:05,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:05,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:05,294 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) [2020-10-19 20:26:05,330 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:05,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:05,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:05,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:05,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:05,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:05,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:05,338 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) [2020-10-19 20:26:05,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:26:05,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:05,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:05,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:05,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:05,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:05,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:05,380 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 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:05,404 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:05,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:05,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:05,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:05,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:05,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:05,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:05,409 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 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:26:05,433 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:05,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:05,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:05,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:05,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:05,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:05,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:05,459 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) [2020-10-19 20:26:05,500 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:05,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:05,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:05,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:05,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:05,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:05,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:05,545 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:26:05,721 INFO L443 ModelExtractionUtils]: Simplification made 41 calls to the SMT solver. [2020-10-19 20:26:05,721 INFO L444 ModelExtractionUtils]: 22 out of 61 variables were initially zero. Simplification set additionally 34 variables to zero. 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) [2020-10-19 20:26:05,726 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:05,730 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 20:26:05,730 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:26:05,730 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_3 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_5 - 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1 >= 0] [2020-10-19 20:26:06,346 INFO L297 tatePredicateManager]: 39 out of 43 supporting invariants were superfluous and have been removed [2020-10-19 20:26:06,355 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:26:06,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:06,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-19 20:26:06,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:06,445 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:06,445 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:06,445 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:06,475 INFO L625 ElimStorePlain]: treesize reduction 10, result has 71.4 percent of original size [2020-10-19 20:26:06,476 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:26:06,476 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:25 [2020-10-19 20:26:06,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 20:26:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:06,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-19 20:26:06,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:06,767 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:06,768 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2020-10-19 20:26:06,768 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 10 states. [2020-10-19 20:26:07,417 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 10 states. Result 62 states and 73 transitions. Complement of second has 13 states. [2020-10-19 20:26:07,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 1 non-accepting loop states 2 accepting loop states [2020-10-19 20:26:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-19 20:26:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2020-10-19 20:26:07,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 36 transitions. Stem has 25 letters. Loop has 3 letters. [2020-10-19 20:26:07,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:07,420 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 20:26:07,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:07,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-19 20:26:07,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:07,507 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:07,507 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:07,508 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:07,537 INFO L625 ElimStorePlain]: treesize reduction 10, result has 71.4 percent of original size [2020-10-19 20:26:07,538 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:26:07,538 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:25 [2020-10-19 20:26:07,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 20:26:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:07,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-19 20:26:07,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:07,849 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:07,850 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2020-10-19 20:26:07,850 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 10 states. [2020-10-19 20:26:08,474 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 10 states. Result 62 states and 73 transitions. Complement of second has 13 states. [2020-10-19 20:26:08,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 1 non-accepting loop states 2 accepting loop states [2020-10-19 20:26:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-19 20:26:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2020-10-19 20:26:08,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 36 transitions. Stem has 25 letters. Loop has 3 letters. [2020-10-19 20:26:08,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:08,477 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 20:26:08,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:08,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-19 20:26:08,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:08,569 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 20:26:08,569 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:08,570 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 20:26:08,599 INFO L625 ElimStorePlain]: treesize reduction 10, result has 71.4 percent of original size [2020-10-19 20:26:08,599 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 20:26:08,600 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:25 [2020-10-19 20:26:08,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 20:26:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:08,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-19 20:26:08,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:08,901 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:08,901 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2020-10-19 20:26:08,901 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 10 states. [2020-10-19 20:26:09,574 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 10 states. Result 76 states and 90 transitions. Complement of second has 12 states. [2020-10-19 20:26:09,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 1 non-accepting loop states 2 accepting loop states [2020-10-19 20:26:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-19 20:26:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2020-10-19 20:26:09,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 25 letters. Loop has 3 letters. [2020-10-19 20:26:09,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:09,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 28 letters. Loop has 3 letters. [2020-10-19 20:26:09,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:09,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 25 letters. Loop has 6 letters. [2020-10-19 20:26:09,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:09,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 90 transitions. [2020-10-19 20:26:09,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:09,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 41 states and 49 transitions. [2020-10-19 20:26:09,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-19 20:26:09,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-19 20:26:09,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2020-10-19 20:26:09,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:26:09,580 INFO L691 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-10-19 20:26:09,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2020-10-19 20:26:09,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2020-10-19 20:26:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-19 20:26:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2020-10-19 20:26:09,582 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-10-19 20:26:09,582 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-10-19 20:26:09,582 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-19 20:26:09,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2020-10-19 20:26:09,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 20:26:09,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:26:09,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:26:09,584 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:26:09,584 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 20:26:09,584 INFO L794 eck$LassoCheckResult]: Stem: 2392#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2384#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 2385#L532 assume !(main_~length1~0 < 1); 2386#L532-2 assume !(main_~length2~0 < 1); 2379#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 2380#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 2399#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 2400#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 2396#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 2397#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 2373#L541-4 main_~i~1 := 0; 2374#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 2381#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 2382#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 2383#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 2404#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 2391#L546-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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 2375#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 2376#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 2395#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 2403#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 2401#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 2369#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 2370#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 2371#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 2372#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 2378#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 2393#L522-5 [2020-10-19 20:26:09,584 INFO L796 eck$LassoCheckResult]: Loop: 2393#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 2387#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 2388#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 2393#L522-5 [2020-10-19 20:26:09,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:09,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2023300851, now seen corresponding path program 4 times [2020-10-19 20:26:09,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:09,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818862974] [2020-10-19 20:26:09,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:09,602 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:09,631 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:09,636 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:09,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:09,637 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 6 times [2020-10-19 20:26:09,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:09,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093052658] [2020-10-19 20:26:09,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:09,641 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:09,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:09,644 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:09,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:09,644 INFO L82 PathProgramCache]: Analyzing trace with hash 584676782, now seen corresponding path program 2 times [2020-10-19 20:26:09,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:26:09,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29718517] [2020-10-19 20:26:09,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:26:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:09,666 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:26:09,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:26:09,698 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:26:11,920 WARN L193 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 242 DAG size of output: 183 [2020-10-19 20:26:17,706 WARN L193 SmtUtils]: Spent 5.77 s on a formula simplification. DAG size of input: 151 DAG size of output: 151 [2020-10-19 20:26:17,711 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:26:17,711 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:26:17,711 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:26:17,711 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:26:17,711 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:26:17,711 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:17,711 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:26:17,711 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:26:17,711 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration13_Lasso [2020-10-19 20:26:17,711 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:26:17,712 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:26:17,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 20:26:17,727 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:17,731 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:17,734 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,348 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-10-19 20:26:19,354 WARN L193 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 118 DAG size of output: 103 [2020-10-19 20:26:19,531 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2020-10-19 20:26:19,532 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,536 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,540 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,543 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,545 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,547 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,553 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,556 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,558 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,561 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,564 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,577 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,579 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,581 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,584 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,587 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,591 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,594 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,596 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,598 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,603 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,605 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,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:26:19,810 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2020-10-19 20:26:20,139 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2020-10-19 20:26:20,691 WARN L193 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2020-10-19 20:26:20,957 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-10-19 20:26:21,175 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-10-19 20:26:21,291 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:26:21,291 INFO L489 LassoAnalysis]: Using template 'affine'. 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:26:21,293 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:21,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:21,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:21,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:21,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:21,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:21,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:21,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:21,297 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) Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:21,318 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:21,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:21,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:21,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:21,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:21,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:21,322 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:21,324 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:26:21,348 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:21,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:21,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:26:21,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:21,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:21,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:21,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:26:21,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:26:21,351 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:26:21,376 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:21,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:21,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:21,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:21,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:21,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:21,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:21,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 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:26:21,407 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:21,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:21,409 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-10-19 20:26:21,409 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2020-10-19 20:26:21,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:21,483 INFO L401 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2020-10-19 20:26:21,484 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2020-10-19 20:26:21,686 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 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:26:21,709 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:21,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:21,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:21,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:21,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:21,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:21,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:21,731 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:26:21,753 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:21,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:21,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:21,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:21,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:21,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:21,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:21,759 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:26:21,783 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:21,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:26:21,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:26:21,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:26:21,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:26:21,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 20:26:21,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 20:26:21,820 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:26:21,880 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-19 20:26:21,880 INFO L444 ModelExtractionUtils]: 11 out of 58 variables were initially zero. Simplification set additionally 44 variables to zero. 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) [2020-10-19 20:26:21,893 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:26:21,896 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 20:26:21,896 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:26:21,896 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_6, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_6 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2020-10-19 20:26:22,267 INFO L297 tatePredicateManager]: 32 out of 33 supporting invariants were superfluous and have been removed [2020-10-19 20:26:22,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 20:26:22,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:22,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:26:22,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:22,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 20:26:22,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:22,409 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:22,409 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:22,409 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 43 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-19 20:26:22,493 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 43 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 52 states and 60 transitions. Complement of second has 7 states. [2020-10-19 20:26:22,494 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:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 20:26:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-10-19 20:26:22,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 27 letters. Loop has 3 letters. [2020-10-19 20:26:22,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:22,496 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 20:26:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:22,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:26:22,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:22,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 20:26:22,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:22,634 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:22,635 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:26:22,635 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 43 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-19 20:26:22,719 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 43 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 52 states and 60 transitions. Complement of second has 7 states. [2020-10-19 20:26:22,720 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:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 20:26:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-10-19 20:26:22,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 27 letters. Loop has 3 letters. [2020-10-19 20:26:22,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:22,721 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 20:26:22,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:26:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:22,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 20:26:22,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:26:22,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 20:26:22,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:26:22,844 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:22,845 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:26:22,845 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 43 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-19 20:26:22,934 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 43 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 51 states and 60 transitions. Complement of second has 6 states. [2020-10-19 20:26:22,936 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:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 20:26:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-10-19 20:26:22,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 27 letters. Loop has 3 letters. [2020-10-19 20:26:22,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:22,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 30 letters. Loop has 3 letters. [2020-10-19 20:26:22,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:22,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 27 letters. Loop has 6 letters. [2020-10-19 20:26:22,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:26:22,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 60 transitions. [2020-10-19 20:26:22,939 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 20:26:22,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 0 states and 0 transitions. [2020-10-19 20:26:22,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 20:26:22,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 20:26:22,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 20:26:22,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:26:22,940 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:26:22,940 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:26:22,940 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 20:26:22,940 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-19 20:26:22,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 20:26:22,940 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 20:26:22,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 20:26:22,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 08:26:22 BoogieIcfgContainer [2020-10-19 20:26:22,948 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 20:26:22,949 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 20:26:22,949 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 20:26:22,949 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 20:26:22,950 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:25:32" (3/4) ... [2020-10-19 20:26:22,954 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 20:26:22,954 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 20:26:22,956 INFO L168 Benchmark]: Toolchain (without parser) took 51969.39 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 500.7 MB). Free memory was 951.9 MB in the beginning and 1.2 GB in the end (delta: -254.0 MB). Peak memory consumption was 246.6 MB. Max. memory is 11.5 GB. [2020-10-19 20:26:22,956 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:26:22,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 946.5 MB in the beginning and 1.1 GB in the end (delta: -108.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2020-10-19 20:26:22,957 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:26:22,958 INFO L168 Benchmark]: Boogie Preprocessor took 33.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2020-10-19 20:26:22,958 INFO L168 Benchmark]: RCFGBuilder took 403.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2020-10-19 20:26:22,958 INFO L168 Benchmark]: BuchiAutomizer took 50944.88 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 426.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -192.5 MB). Peak memory consumption was 234.3 MB. Max. memory is 11.5 GB. [2020-10-19 20:26:22,959 INFO L168 Benchmark]: Witness Printer took 5.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2020-10-19 20:26:22,961 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 523.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 946.5 MB in the beginning and 1.1 GB in the end (delta: -108.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 403.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 50944.88 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 426.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -192.5 MB). Peak memory consumption was 234.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. 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 (7 trivial, 4 deterministic, 2 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 and consists of 5 locations. One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[nondetString1] and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[sc1] and consists of 11 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 5 locations. 7 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 50.8s and 14 iterations. TraceHistogramMax:2. Analysis of lassos took 44.0s. Construction of modules took 1.1s. Büchi inclusion checks took 5.4s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 36 states and ocurred in iteration 12. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 287 SDtfs, 863 SDslu, 671 SDs, 0 SdLazy, 981 SolverSat, 171 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI1 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital468 mio100 ax106 hnf98 lsp128 ukn54 mio100 lsp50 div108 bol100 ite100 ukn100 eq176 hnf86 smp85 dnf463 smp53 tf100 neg98 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 506ms VariablesStem: 10 VariablesLoop: 6 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...