./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/cstrcmp-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 df3db790fa8159689a8da2e25598b93c123cddf7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:25:27,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:25:27,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:25:27,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:25:27,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:25:27,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:25:27,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:25:27,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:25:27,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:25:27,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:25:27,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:25:27,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:25:27,536 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:25:27,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:25:27,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:25:27,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:25:27,543 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:25:27,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:25:27,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:25:27,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:25:27,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:25:27,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:25:27,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:25:27,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:25:27,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:25:27,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:25:27,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:25:27,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:25:27,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:25:27,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:25:27,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:25:27,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:25:27,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:25:27,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:25:27,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:25:27,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:25:27,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:25:27,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:25:27,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:25:27,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:25:27,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:25:27,575 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:25:27,616 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:25:27,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:25:27,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:25:27,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:25:27,620 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:25:27,620 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:25:27,620 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:25:27,621 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:25:27,621 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:25:27,621 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:25:27,621 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:25:27,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:25:27,622 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:25:27,622 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:25:27,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:25:27,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:25:27,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:25:27,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:25:27,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:25:27,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:25:27,623 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:25:27,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:25:27,624 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:25:27,624 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:25:27,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:25:27,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:25:27,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:25:27,625 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:25:27,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:25:27,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:25:27,627 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:25:27,627 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:25:27,629 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:25:27,629 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 -> df3db790fa8159689a8da2e25598b93c123cddf7 [2020-07-29 03:25:27,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:25:27,926 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:25:27,929 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:25:27,931 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:25:27,933 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:25:27,934 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2020-07-29 03:25:28,001 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3168e026c/e7faa9d6dc2045aab7ce8a7f012a7b5e/FLAG71e31262d [2020-07-29 03:25:28,458 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:25:28,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2020-07-29 03:25:28,473 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3168e026c/e7faa9d6dc2045aab7ce8a7f012a7b5e/FLAG71e31262d [2020-07-29 03:25:28,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3168e026c/e7faa9d6dc2045aab7ce8a7f012a7b5e [2020-07-29 03:25:28,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:25:28,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:25:28,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:28,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:25:28,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:25:28,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:28" (1/1) ... [2020-07-29 03:25:28,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46506e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:28, skipping insertion in model container [2020-07-29 03:25:28,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:28" (1/1) ... [2020-07-29 03:25:28,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:25:28,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:25:29,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:29,230 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:25:29,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:29,341 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:25:29,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:29 WrapperNode [2020-07-29 03:25:29,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:29,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:29,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:25:29,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:25:29,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:29" (1/1) ... [2020-07-29 03:25:29,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:29" (1/1) ... [2020-07-29 03:25:29,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:29,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:25:29,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:25:29,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:25:29,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:29" (1/1) ... [2020-07-29 03:25:29,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:29" (1/1) ... [2020-07-29 03:25:29,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:29" (1/1) ... [2020-07-29 03:25:29,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:29" (1/1) ... [2020-07-29 03:25:29,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:29" (1/1) ... [2020-07-29 03:25:29,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:29" (1/1) ... [2020-07-29 03:25:29,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:29" (1/1) ... [2020-07-29 03:25:29,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:25:29,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:25:29,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:25:29,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:25:29,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:29" (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-07-29 03:25:29,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:25:29,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:25:29,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:25:29,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:25:29,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:25:29,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:25:29,994 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:25:29,995 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-29 03:25:29,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:29 BoogieIcfgContainer [2020-07-29 03:25:29,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:25:29,999 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:25:29,999 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:25:30,003 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:25:30,008 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:30,008 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:25:28" (1/3) ... [2020-07-29 03:25:30,010 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@253a7e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:30, skipping insertion in model container [2020-07-29 03:25:30,010 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:30,012 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:29" (2/3) ... [2020-07-29 03:25:30,014 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@253a7e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:30, skipping insertion in model container [2020-07-29 03:25:30,015 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:30,015 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:29" (3/3) ... [2020-07-29 03:25:30,017 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcmp-alloca-2.i [2020-07-29 03:25:30,072 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:25:30,072 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:25:30,072 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:25:30,072 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:25:30,073 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:25:30,073 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:25:30,073 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:25:30,073 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:25:30,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 03:25:30,129 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2020-07-29 03:25:30,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:30,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:30,134 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:25:30,134 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:30,135 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:25:30,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 03:25:30,138 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2020-07-29 03:25:30,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:30,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:30,139 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:25:30,139 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:30,146 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 20#L528true assume !(main_~length1~0 < 1); 4#L528-2true assume !(main_~length2~0 < 1); 16#L531-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 7#L537-3true [2020-07-29 03:25:30,146 INFO L796 eck$LassoCheckResult]: Loop: 7#L537-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 6#L537-2true main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 7#L537-3true [2020-07-29 03:25:30,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:30,151 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 03:25:30,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:30,159 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289002365] [2020-07-29 03:25:30,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:30,247 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:30,263 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:30,285 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:30,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:30,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2020-07-29 03:25:30,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:30,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041411653] [2020-07-29 03:25:30,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:30,298 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:30,307 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:30,311 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:30,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:30,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2020-07-29 03:25:30,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:30,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983626667] [2020-07-29 03:25:30,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:30,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:30,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:30,363 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:30,641 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-07-29 03:25:30,793 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:30,794 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:30,794 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:30,796 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:30,797 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:30,797 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:30,797 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:30,797 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:30,797 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca-2.i_Iteration1_Lasso [2020-07-29 03:25:30,798 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:30,798 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:30,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:31,079 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-07-29 03:25:31,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:31,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:31,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:31,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:31,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:31,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:31,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:31,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:31,855 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:31,862 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:31,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:31,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:31,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:31,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:31,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:31,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:31,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:31,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:31,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:31,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:31,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:31,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:31,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:31,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:31,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:31,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:31,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:31,927 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-07-29 03:25:31,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:31,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:31,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:31,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:31,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:31,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:31,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:31,973 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-07-29 03:25:31,975 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-07-29 03:25:32,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:32,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:32,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:32,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:32,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:32,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:32,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:32,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:32,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:32,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:32,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:32,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:32,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:32,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:32,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:32,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:32,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:32,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:32,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:32,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:32,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:32,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:32,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:32,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:32,081 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-07-29 03:25:32,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:32,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:32,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:32,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:32,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:32,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:32,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:32,127 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-07-29 03:25:32,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:32,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:32,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:32,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:32,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:32,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:32,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:32,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:32,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:32,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:32,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:32,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:32,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:32,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:32,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:32,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:32,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:32,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:32,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:32,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:32,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:32,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:32,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:32,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:32,277 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-07-29 03:25:32,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:32,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:32,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:32,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:32,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:32,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:32,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:32,308 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-07-29 03:25:32,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:32,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:32,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:32,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:32,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:32,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:32,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:32,342 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-07-29 03:25:32,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:32,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:32,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:32,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:32,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:32,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:32,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:32,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:32,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:32,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:32,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:32,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:32,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:32,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:32,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:32,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:32,424 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:32,526 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 03:25:32,527 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. 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-07-29 03:25:32,555 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:32,560 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:32,560 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:32,561 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-07-29 03:25:32,615 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:25:32,619 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16;" "main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15;" [2020-07-29 03:25:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:32,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:32,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:32,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:32,704 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {31#unseeded} is VALID [2020-07-29 03:25:32,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#unseeded} havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; {31#unseeded} is VALID [2020-07-29 03:25:32,707 INFO L280 TraceCheckUtils]: 2: Hoare triple {31#unseeded} assume !(main_~length1~0 < 1); {31#unseeded} is VALID [2020-07-29 03:25:32,707 INFO L280 TraceCheckUtils]: 3: Hoare triple {31#unseeded} assume !(main_~length2~0 < 1); {31#unseeded} is VALID [2020-07-29 03:25:32,708 INFO L280 TraceCheckUtils]: 4: Hoare triple {31#unseeded} call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; {31#unseeded} is VALID [2020-07-29 03:25:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:32,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:32,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:32,743 INFO L280 TraceCheckUtils]: 0: Hoare triple {34#(>= oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {91#(and (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0))} is VALID [2020-07-29 03:25:32,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#(and (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0))} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {74#(or (and (> oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:32,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:32,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:32,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:32,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,780 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-07-29 03:25:32,781 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2020-07-29 03:25:32,946 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 51 states and 73 transitions. Complement of second has 7 states. [2020-07-29 03:25:32,947 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-07-29 03:25:32,947 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:32,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 03:25:32,953 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2020-07-29 03:25:32,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:32,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:32,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:32,972 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:32,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:32,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:32,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 73 transitions. [2020-07-29 03:25:32,978 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 03:25:32,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:32,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:32,980 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states. [2020-07-29 03:25:32,983 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2020-07-29 03:25:32,985 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:25:32,985 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:32,988 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:32,989 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:32,989 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 51 states and 73 transitions. cyclomatic complexity: 29 [2020-07-29 03:25:32,990 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 03:25:32,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:32,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:32,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:32,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:32,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:32,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:32,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:32,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:32,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:32,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 51 letters. Loop has 51 letters. [2020-07-29 03:25:32,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 51 letters. [2020-07-29 03:25:32,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 51 letters. Loop has 51 letters. [2020-07-29 03:25:32,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:25:32,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:25:32,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:25:32,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:32,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:32,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:32,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:32,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:32,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:32,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:32,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:32,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:32,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:33,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:33,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:33,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:33,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:33,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:33,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:33,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:33,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:33,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:33,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:33,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:33,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:33,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:33,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:33,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:33,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:33,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:33,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:33,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:33,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:33,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:33,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:33,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:33,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:33,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:33,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:33,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:33,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:33,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:33,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:33,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:33,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:33,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:33,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:33,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 73 transitions. cyclomatic complexity: 29 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:33,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,014 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-29 03:25:33,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:33,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:33,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:25:33,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:33,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 73 transitions. cyclomatic complexity: 29 [2020-07-29 03:25:33,027 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 03:25:33,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 15 states and 21 transitions. [2020-07-29 03:25:33,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:25:33,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 03:25:33,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2020-07-29 03:25:33,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:33,034 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-07-29 03:25:33,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2020-07-29 03:25:33,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-29 03:25:33,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:33,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 21 transitions. Second operand 15 states. [2020-07-29 03:25:33,061 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 21 transitions. Second operand 15 states. [2020-07-29 03:25:33,063 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. Second operand 15 states. [2020-07-29 03:25:33,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:33,068 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2020-07-29 03:25:33,068 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2020-07-29 03:25:33,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:33,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:33,069 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states and 21 transitions. [2020-07-29 03:25:33,069 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states and 21 transitions. [2020-07-29 03:25:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:33,071 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2020-07-29 03:25:33,071 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2020-07-29 03:25:33,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:33,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:33,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:33,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:33,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 03:25:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2020-07-29 03:25:33,074 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-07-29 03:25:33,074 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-07-29 03:25:33,074 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:25:33,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2020-07-29 03:25:33,075 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 03:25:33,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:33,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:33,076 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:33,076 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:33,076 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 166#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 167#L528 assume !(main_~length1~0 < 1); 158#L528-2 assume !(main_~length2~0 < 1); 159#L531-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 163#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 164#L537-4 main_~i~1 := 0; 165#L542-3 [2020-07-29 03:25:33,076 INFO L796 eck$LassoCheckResult]: Loop: 165#L542-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 169#L542-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 165#L542-3 [2020-07-29 03:25:33,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:33,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2020-07-29 03:25:33,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:33,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698086123] [2020-07-29 03:25:33,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:33,102 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:33,118 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:33,122 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:33,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:33,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2020-07-29 03:25:33,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:33,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795399434] [2020-07-29 03:25:33,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:33,130 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:33,135 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:33,137 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:33,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2020-07-29 03:25:33,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:33,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986062809] [2020-07-29 03:25:33,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:33,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:33,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:33,176 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:33,386 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-07-29 03:25:33,478 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:33,478 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:33,478 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:33,479 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:33,479 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:33,479 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:33,479 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:33,479 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:33,479 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca-2.i_Iteration2_Lasso [2020-07-29 03:25:33,480 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:33,480 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:33,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-07-29 03:25:33,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,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-07-29 03:25:33,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-07-29 03:25:33,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,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-07-29 03:25:33,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-07-29 03:25:33,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:34,314 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:34,314 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:34,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:34,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:34,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:34,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:34,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:34,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:34,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:34,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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:34,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07-29 03:25:34,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:34,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:34,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:34,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:34,426 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-07-29 03:25:34,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:34,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,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-07-29 03:25:34,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:34,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:34,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:34,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07-29 03:25:34,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:34,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:34,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:34,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:34,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:34,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:34,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:34,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:34,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 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:34,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:34,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:34,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:34,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,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-07-29 03:25:34,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:34,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:34,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,771 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-07-29 03:25:34,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:34,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,816 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) [2020-07-29 03:25:34,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:34,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:34,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:34,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:34,846 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:34,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:34,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07-29 03:25:34,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:34,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:34,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:34,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:34,905 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-07-29 03:25:34,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:34,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,952 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:34,978 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 03:25:34,978 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:34,991 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,998 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:34,998 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:34,999 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2020-07-29 03:25:35,057 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:25:35,060 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18;" "main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17;" [2020-07-29 03:25:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:35,099 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {210#unseeded} is VALID [2020-07-29 03:25:35,100 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#unseeded} havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; {210#unseeded} is VALID [2020-07-29 03:25:35,100 INFO L280 TraceCheckUtils]: 2: Hoare triple {210#unseeded} assume !(main_~length1~0 < 1); {210#unseeded} is VALID [2020-07-29 03:25:35,101 INFO L280 TraceCheckUtils]: 3: Hoare triple {210#unseeded} assume !(main_~length2~0 < 1); {210#unseeded} is VALID [2020-07-29 03:25:35,101 INFO L280 TraceCheckUtils]: 4: Hoare triple {210#unseeded} call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; {210#unseeded} is VALID [2020-07-29 03:25:35,102 INFO L280 TraceCheckUtils]: 5: Hoare triple {210#unseeded} assume !(main_~i~0 < main_~length1~0 - 1); {210#unseeded} is VALID [2020-07-29 03:25:35,102 INFO L280 TraceCheckUtils]: 6: Hoare triple {210#unseeded} main_~i~1 := 0; {210#unseeded} is VALID [2020-07-29 03:25:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:35,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {213#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~1) ULTIMATE.start_main_~length2~0))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; {276#(and (< (+ ULTIMATE.start_main_~i~1 1) ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~length2~0 (+ oldRank0 ULTIMATE.start_main_~i~1)))} is VALID [2020-07-29 03:25:35,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {276#(and (< (+ ULTIMATE.start_main_~i~1 1) ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~length2~0 (+ oldRank0 ULTIMATE.start_main_~i~1)))} main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; {253#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~1) ULTIMATE.start_main_~length2~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:35,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:35,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:35,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:35,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,142 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-07-29 03:25:35,143 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-07-29 03:25:35,205 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 21 states and 32 transitions. Complement of second has 6 states. [2020-07-29 03:25:35,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:35,205 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:35,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. cyclomatic complexity: 9 [2020-07-29 03:25:35,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:35,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:35,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:35,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:35,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:35,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:35,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. [2020-07-29 03:25:35,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:35,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:35,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:35,209 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 21 transitions. cyclomatic complexity: 9 [2020-07-29 03:25:35,210 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 03:25:35,210 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:35,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:35,211 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:35,211 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 32 transitions. cyclomatic complexity: 15 [2020-07-29 03:25:35,212 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:25:35,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:35,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:35,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:35,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:35,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:35,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:35,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:25:35,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:25:35,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:25:35,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:25:35,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:25:35,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:25:35,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:35,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:35,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:35,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:35,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:35,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:35,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:35,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:35,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:35,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:35,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:35,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:35,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:35,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:35,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:35,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:35,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:35,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:35,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:35,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:35,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:35,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:35,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:35,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:35,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:35,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:35,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:35,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,225 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:35,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-07-29 03:25:35,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:35,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:35,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:25:35,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 32 transitions. cyclomatic complexity: 15 [2020-07-29 03:25:35,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:35,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 23 transitions. [2020-07-29 03:25:35,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 03:25:35,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:25:35,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2020-07-29 03:25:35,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:35,232 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2020-07-29 03:25:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2020-07-29 03:25:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-29 03:25:35,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:35,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 23 transitions. Second operand 16 states. [2020-07-29 03:25:35,234 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 23 transitions. Second operand 16 states. [2020-07-29 03:25:35,234 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 16 states. [2020-07-29 03:25:35,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:35,236 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2020-07-29 03:25:35,236 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2020-07-29 03:25:35,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:35,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:35,236 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states and 23 transitions. [2020-07-29 03:25:35,236 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states and 23 transitions. [2020-07-29 03:25:35,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:35,238 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2020-07-29 03:25:35,238 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2020-07-29 03:25:35,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:35,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:35,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:35,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 03:25:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2020-07-29 03:25:35,240 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2020-07-29 03:25:35,240 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2020-07-29 03:25:35,240 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:25:35,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2020-07-29 03:25:35,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:35,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:35,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:35,241 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:35,241 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:35,242 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 320#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 321#L528 assume !(main_~length1~0 < 1); 312#L528-2 assume !(main_~length2~0 < 1); 313#L531-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 317#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 318#L537-4 main_~i~1 := 0; 319#L542-3 assume !(main_~i~1 < main_~length2~0 - 1); 325#L542-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);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 314#L517-5 [2020-07-29 03:25:35,242 INFO L796 eck$LassoCheckResult]: Loop: 314#L517-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 310#L517-1 assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 311#L517-3 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~short5;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 314#L517-5 [2020-07-29 03:25:35,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:35,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2020-07-29 03:25:35,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:35,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604079262] [2020-07-29 03:25:35,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,276 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,306 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,315 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:35,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:35,315 INFO L82 PathProgramCache]: Analyzing trace with hash 77559, now seen corresponding path program 1 times [2020-07-29 03:25:35,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:35,316 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694447429] [2020-07-29 03:25:35,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,332 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,344 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,349 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:35,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash -296047742, now seen corresponding path program 1 times [2020-07-29 03:25:35,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:35,355 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022218950] [2020-07-29 03:25:35,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,571 INFO L280 TraceCheckUtils]: 0: Hoare triple {365#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {365#true} is VALID [2020-07-29 03:25:35,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {365#true} havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; {365#true} is VALID [2020-07-29 03:25:35,572 INFO L280 TraceCheckUtils]: 2: Hoare triple {365#true} assume !(main_~length1~0 < 1); {367#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:25:35,573 INFO L280 TraceCheckUtils]: 3: Hoare triple {367#(<= 1 ULTIMATE.start_main_~length1~0)} assume !(main_~length2~0 < 1); {367#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:25:35,575 INFO L280 TraceCheckUtils]: 4: Hoare triple {367#(<= 1 ULTIMATE.start_main_~length1~0)} call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; {368#(and (or (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (and (= 0 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)))} is VALID [2020-07-29 03:25:35,576 INFO L280 TraceCheckUtils]: 5: Hoare triple {368#(and (or (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (and (= 0 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)))} assume !(main_~i~0 < main_~length1~0 - 1); {369#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:35,577 INFO L280 TraceCheckUtils]: 6: Hoare triple {369#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} main_~i~1 := 0; {369#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:35,577 INFO L280 TraceCheckUtils]: 7: Hoare triple {369#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} assume !(main_~i~1 < main_~length2~0 - 1); {369#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:35,579 INFO L280 TraceCheckUtils]: 8: Hoare triple {369#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} 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);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; {370#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base) ULTIMATE.start_cstrcmp_~s1.offset))} is VALID [2020-07-29 03:25:35,580 INFO L280 TraceCheckUtils]: 9: Hoare triple {370#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base) ULTIMATE.start_cstrcmp_~s1.offset))} call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; {371#(not |ULTIMATE.start_cstrcmp_#t~short5|)} is VALID [2020-07-29 03:25:35,581 INFO L280 TraceCheckUtils]: 10: Hoare triple {371#(not |ULTIMATE.start_cstrcmp_#t~short5|)} assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; {366#false} is VALID [2020-07-29 03:25:35,581 INFO L280 TraceCheckUtils]: 11: Hoare triple {366#false} assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~short5;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; {366#false} is VALID [2020-07-29 03:25:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:35,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022218950] [2020-07-29 03:25:35,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:35,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 03:25:35,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701960210] [2020-07-29 03:25:35,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:35,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 03:25:35,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-29 03:25:35,741 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. cyclomatic complexity: 10 Second operand 7 states. [2020-07-29 03:25:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:35,990 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-07-29 03:25:35,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 03:25:35,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 03:25:36,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:36,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2020-07-29 03:25:36,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:36,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 17 states and 22 transitions. [2020-07-29 03:25:36,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:25:36,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:25:36,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2020-07-29 03:25:36,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:36,014 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-07-29 03:25:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2020-07-29 03:25:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-07-29 03:25:36,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:36,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 22 transitions. Second operand 16 states. [2020-07-29 03:25:36,016 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 22 transitions. Second operand 16 states. [2020-07-29 03:25:36,016 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 16 states. [2020-07-29 03:25:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:36,017 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2020-07-29 03:25:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2020-07-29 03:25:36,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:36,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:36,018 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states and 22 transitions. [2020-07-29 03:25:36,018 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states and 22 transitions. [2020-07-29 03:25:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:36,019 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2020-07-29 03:25:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2020-07-29 03:25:36,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:36,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:36,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:36,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 03:25:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-07-29 03:25:36,021 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-29 03:25:36,021 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-29 03:25:36,021 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:25:36,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2020-07-29 03:25:36,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:36,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:36,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:36,022 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:36,022 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:36,022 INFO L794 eck$LassoCheckResult]: Stem: 416#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 414#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 415#L528 assume !(main_~length1~0 < 1); 406#L528-2 assume !(main_~length2~0 < 1); 407#L531-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 411#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 409#L537-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 410#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 412#L537-4 main_~i~1 := 0; 413#L542-3 assume !(main_~i~1 < main_~length2~0 - 1); 419#L542-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);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 408#L517-5 [2020-07-29 03:25:36,022 INFO L796 eck$LassoCheckResult]: Loop: 408#L517-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 404#L517-1 assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 405#L517-3 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~short5;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 408#L517-5 [2020-07-29 03:25:36,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:36,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2020-07-29 03:25:36,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:36,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495027054] [2020-07-29 03:25:36,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:36,037 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:36,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:36,055 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:36,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:36,056 INFO L82 PathProgramCache]: Analyzing trace with hash 77559, now seen corresponding path program 2 times [2020-07-29 03:25:36,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:36,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779458611] [2020-07-29 03:25:36,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:36,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:36,066 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:36,068 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:36,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:36,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1311502304, now seen corresponding path program 1 times [2020-07-29 03:25:36,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:36,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55348350] [2020-07-29 03:25:36,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:36,349 INFO L280 TraceCheckUtils]: 0: Hoare triple {461#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {461#true} is VALID [2020-07-29 03:25:36,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {461#true} havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; {461#true} is VALID [2020-07-29 03:25:36,350 INFO L280 TraceCheckUtils]: 2: Hoare triple {461#true} assume !(main_~length1~0 < 1); {461#true} is VALID [2020-07-29 03:25:36,351 INFO L280 TraceCheckUtils]: 3: Hoare triple {461#true} assume !(main_~length2~0 < 1); {463#(<= 1 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:25:36,352 INFO L280 TraceCheckUtils]: 4: Hoare triple {463#(<= 1 ULTIMATE.start_main_~length2~0)} call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; {464#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:36,353 INFO L280 TraceCheckUtils]: 5: Hoare triple {464#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {464#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:36,353 INFO L280 TraceCheckUtils]: 6: Hoare triple {464#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {464#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:36,354 INFO L280 TraceCheckUtils]: 7: Hoare triple {464#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~0 < main_~length1~0 - 1); {464#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:36,355 INFO L280 TraceCheckUtils]: 8: Hoare triple {464#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_~i~1 := 0; {465#(and (or (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (and (= 0 ULTIMATE.start_main_~i~1) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:36,355 INFO L280 TraceCheckUtils]: 9: Hoare triple {465#(and (or (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (and (= 0 ULTIMATE.start_main_~i~1) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~1 < main_~length2~0 - 1); {466#(and (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:36,356 INFO L280 TraceCheckUtils]: 10: Hoare triple {466#(and (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} 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);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; {467#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base) ULTIMATE.start_cstrcmp_~s2.offset))} is VALID [2020-07-29 03:25:36,357 INFO L280 TraceCheckUtils]: 11: Hoare triple {467#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base) ULTIMATE.start_cstrcmp_~s2.offset))} call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; {468#(or (not (= (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base) ULTIMATE.start_cstrcmp_~s2.offset) (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base) ULTIMATE.start_cstrcmp_~s1.offset))) (not |ULTIMATE.start_cstrcmp_#t~short5|))} is VALID [2020-07-29 03:25:36,358 INFO L280 TraceCheckUtils]: 12: Hoare triple {468#(or (not (= (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base) ULTIMATE.start_cstrcmp_~s2.offset) (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base) ULTIMATE.start_cstrcmp_~s1.offset))) (not |ULTIMATE.start_cstrcmp_#t~short5|))} assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; {469#(not |ULTIMATE.start_cstrcmp_#t~short5|)} is VALID [2020-07-29 03:25:36,358 INFO L280 TraceCheckUtils]: 13: Hoare triple {469#(not |ULTIMATE.start_cstrcmp_#t~short5|)} assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~short5;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; {462#false} is VALID [2020-07-29 03:25:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:25:36,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55348350] [2020-07-29 03:25:36,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:36,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-29 03:25:36,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821736714] [2020-07-29 03:25:36,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:36,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 03:25:36,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-29 03:25:36,500 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 9 states. [2020-07-29 03:25:36,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:36,741 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-29 03:25:36,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:25:36,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 03:25:36,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:36,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2020-07-29 03:25:36,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:36,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 21 transitions. [2020-07-29 03:25:36,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:25:36,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:25:36,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2020-07-29 03:25:36,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:36,769 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-07-29 03:25:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2020-07-29 03:25:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-07-29 03:25:36,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:36,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 21 transitions. Second operand 16 states. [2020-07-29 03:25:36,770 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 21 transitions. Second operand 16 states. [2020-07-29 03:25:36,770 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 16 states. [2020-07-29 03:25:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:36,771 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2020-07-29 03:25:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-07-29 03:25:36,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:36,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:36,772 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states and 21 transitions. [2020-07-29 03:25:36,772 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states and 21 transitions. [2020-07-29 03:25:36,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:36,773 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2020-07-29 03:25:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-07-29 03:25:36,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:36,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:36,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:36,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:36,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 03:25:36,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-07-29 03:25:36,775 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 03:25:36,775 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 03:25:36,775 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:25:36,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-07-29 03:25:36,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:36,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:36,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:36,776 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:36,776 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:36,776 INFO L794 eck$LassoCheckResult]: Stem: 509#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 507#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 508#L528 assume !(main_~length1~0 < 1); 499#L528-2 assume !(main_~length2~0 < 1); 500#L531-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 504#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 502#L537-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 503#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 505#L537-4 main_~i~1 := 0; 506#L542-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 510#L542-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 511#L542-3 assume !(main_~i~1 < main_~length2~0 - 1); 512#L542-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);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 501#L517-5 [2020-07-29 03:25:36,776 INFO L796 eck$LassoCheckResult]: Loop: 501#L517-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 497#L517-1 assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 498#L517-3 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~short5;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 501#L517-5 [2020-07-29 03:25:36,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:36,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2020-07-29 03:25:36,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:36,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666914515] [2020-07-29 03:25:36,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:36,790 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:36,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:36,806 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:36,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash 77559, now seen corresponding path program 3 times [2020-07-29 03:25:36,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:36,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385690385] [2020-07-29 03:25:36,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:36,812 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:36,815 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:36,817 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:36,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:36,818 INFO L82 PathProgramCache]: Analyzing trace with hash -718433154, now seen corresponding path program 1 times [2020-07-29 03:25:36,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:36,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784290010] [2020-07-29 03:25:36,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:36,835 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:36,850 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:36,855 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:37,630 WARN L193 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 111 [2020-07-29 03:25:37,961 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-07-29 03:25:37,966 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:37,966 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:37,966 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:37,966 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:37,966 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:37,966 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:37,967 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:37,967 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:37,967 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca-2.i_Iteration5_Lasso [2020-07-29 03:25:37,967 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:37,967 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:38,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,617 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2020-07-29 03:25:38,829 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2020-07-29 03:25:38,831 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:38,832 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:38,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,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-07-29 03:25:38,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,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-07-29 03:25:38,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-07-29 03:25:38,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,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-07-29 03:25:38,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:38,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-07-29 03:25:39,474 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-07-29 03:25:40,193 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:40,193 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:40,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:40,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:40,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:40,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:40,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:40,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:40,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:40,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:40,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:40,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:40,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:40,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:40,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:40,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:40,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:40,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:40,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:40,229 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-07-29 03:25:40,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:40,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:40,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:40,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:40,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:40,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:40,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:40,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07-29 03:25:40,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:40,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:40,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:40,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:40,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:40,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:40,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:40,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 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-07-29 03:25:40,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:40,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:40,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:40,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:40,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:40,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:40,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:40,333 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-07-29 03:25:40,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:40,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:40,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:40,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:40,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:40,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:40,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:40,369 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-07-29 03:25:40,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:40,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:40,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:40,394 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 03:25:40,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:40,401 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-07-29 03:25:40,401 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 03:25:40,424 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) [2020-07-29 03:25:40,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:40,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:40,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:40,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:40,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:40,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:40,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:40,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:40,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-07-29 03:25:40,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:40,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:40,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:40,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:40,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:40,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:40,570 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:40,667 INFO L443 ModelExtractionUtils]: Simplification made 35 calls to the SMT solver. [2020-07-29 03:25:40,667 INFO L444 ModelExtractionUtils]: 9 out of 55 variables were initially zero. Simplification set additionally 41 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:40,669 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:40,672 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:25:40,672 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:40,673 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_cstrcmp_~s2.offset + 2*ULTIMATE.start_main_~i~0 Supporting invariants [2*ULTIMATE.start_main_~i~0 - 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2 >= 0] [2020-07-29 03:25:40,822 INFO L297 tatePredicateManager]: 22 out of 25 supporting invariants were superfluous and have been removed [2020-07-29 03:25:40,833 INFO L393 LassoCheck]: Loop: "call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2;" "assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4;" "assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~short5;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset;" [2020-07-29 03:25:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:40,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:40,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 32 conjunts are in the unsatisfiable core [2020-07-29 03:25:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:40,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:40,952 INFO L440 ElimStorePlain]: Different costs {0=[|v_#length_89|], 1=[|v_#valid_118|]} [2020-07-29 03:25:40,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 03:25:40,969 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-29 03:25:40,969 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:25:40,987 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:25:40,997 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-29 03:25:41,009 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 03:25:41,021 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:25:41,032 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:25:41,032 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-07-29 03:25:41,036 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:25:41,037 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_89|, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~length2~0, |v_#valid_118|]. (and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= (store (store |v_#length_89| ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_main_~length2~0) |#length|) (<= (select (store |v_#valid_118| ULTIMATE.start_main_~nondetString1~0.base 1) ULTIMATE.start_main_~nondetString2~0.base) 0) (<= 0 ULTIMATE.start_main_~i~0) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) [2020-07-29 03:25:41,037 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (<= 0 ULTIMATE.start_main_~i~0) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) [2020-07-29 03:25:41,180 INFO L280 TraceCheckUtils]: 0: Hoare triple {556#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {556#unseeded} is VALID [2020-07-29 03:25:41,184 INFO L280 TraceCheckUtils]: 1: Hoare triple {556#unseeded} havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; {556#unseeded} is VALID [2020-07-29 03:25:41,188 INFO L280 TraceCheckUtils]: 2: Hoare triple {556#unseeded} assume !(main_~length1~0 < 1); {556#unseeded} is VALID [2020-07-29 03:25:41,188 INFO L280 TraceCheckUtils]: 3: Hoare triple {556#unseeded} assume !(main_~length2~0 < 1); {556#unseeded} is VALID [2020-07-29 03:25:41,189 INFO L280 TraceCheckUtils]: 4: Hoare triple {556#unseeded} call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; {718#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= 0 ULTIMATE.start_main_~i~0) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:41,190 INFO L280 TraceCheckUtils]: 5: Hoare triple {718#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= 0 ULTIMATE.start_main_~i~0) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {718#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= 0 ULTIMATE.start_main_~i~0) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:41,191 INFO L280 TraceCheckUtils]: 6: Hoare triple {718#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= 0 ULTIMATE.start_main_~i~0) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {725#(and (<= 1 ULTIMATE.start_main_~i~0) (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:41,191 INFO L280 TraceCheckUtils]: 7: Hoare triple {725#(and (<= 1 ULTIMATE.start_main_~i~0) (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~0 < main_~length1~0 - 1); {729#(and (<= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~i~0 1)) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:41,192 INFO L280 TraceCheckUtils]: 8: Hoare triple {729#(and (<= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~i~0 1)) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_~i~1 := 0; {729#(and (<= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~i~0 1)) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:41,193 INFO L280 TraceCheckUtils]: 9: Hoare triple {729#(and (<= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~i~0 1)) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; {729#(and (<= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~i~0 1)) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:41,197 INFO L280 TraceCheckUtils]: 10: Hoare triple {729#(and (<= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~i~0 1)) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; {729#(and (<= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~i~0 1)) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:41,197 INFO L280 TraceCheckUtils]: 11: Hoare triple {729#(and (<= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~i~0 1)) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~1 < main_~length2~0 - 1); {729#(and (<= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~i~0 1)) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:41,199 INFO L280 TraceCheckUtils]: 12: Hoare triple {729#(and (<= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~i~0 1)) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} 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);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; {697#(and (>= (+ (* 2 ULTIMATE.start_main_~i~0) (* (- 1) (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) 0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrcmp_~s1.base) (= ULTIMATE.start_cstrcmp_~s1.offset ULTIMATE.start_cstrcmp_~s2.offset) unseeded)} is VALID [2020-07-29 03:25:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:41,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 03:25:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:41,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:41,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {698#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrcmp_~s2.offset) (* 2 ULTIMATE.start_main_~i~0))) (>= (+ (* 2 ULTIMATE.start_main_~i~0) (* (- 1) (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) 0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrcmp_~s1.base) (= ULTIMATE.start_cstrcmp_~s1.offset ULTIMATE.start_cstrcmp_~s2.offset))} call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; {745#(and (<= (+ ULTIMATE.start_cstrcmp_~s1.offset 1) (select |#length| ULTIMATE.start_cstrcmp_~s1.base)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_cstrcmp_~s2.offset oldRank0)) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (* 2 ULTIMATE.start_main_~i~0)) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrcmp_~s1.base) (= ULTIMATE.start_cstrcmp_~s1.offset ULTIMATE.start_cstrcmp_~s2.offset))} is VALID [2020-07-29 03:25:41,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {745#(and (<= (+ ULTIMATE.start_cstrcmp_~s1.offset 1) (select |#length| ULTIMATE.start_cstrcmp_~s1.base)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_cstrcmp_~s2.offset oldRank0)) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (* 2 ULTIMATE.start_main_~i~0)) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrcmp_~s1.base) (= ULTIMATE.start_cstrcmp_~s1.offset ULTIMATE.start_cstrcmp_~s2.offset))} assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; {745#(and (<= (+ ULTIMATE.start_cstrcmp_~s1.offset 1) (select |#length| ULTIMATE.start_cstrcmp_~s1.base)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_cstrcmp_~s2.offset oldRank0)) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (* 2 ULTIMATE.start_main_~i~0)) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrcmp_~s1.base) (= ULTIMATE.start_cstrcmp_~s1.offset ULTIMATE.start_cstrcmp_~s2.offset))} is VALID [2020-07-29 03:25:41,269 INFO L280 TraceCheckUtils]: 2: Hoare triple {745#(and (<= (+ ULTIMATE.start_cstrcmp_~s1.offset 1) (select |#length| ULTIMATE.start_cstrcmp_~s1.base)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_cstrcmp_~s2.offset oldRank0)) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (* 2 ULTIMATE.start_main_~i~0)) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrcmp_~s1.base) (= ULTIMATE.start_cstrcmp_~s1.offset ULTIMATE.start_cstrcmp_~s2.offset))} assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~short5;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; {700#(and (>= (+ (* 2 ULTIMATE.start_main_~i~0) (* (- 1) (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) 0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_cstrcmp_~s1.base) (= ULTIMATE.start_cstrcmp_~s1.offset ULTIMATE.start_cstrcmp_~s2.offset) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrcmp_~s2.offset) (* 2 ULTIMATE.start_main_~i~0)))) unseeded))} is VALID [2020-07-29 03:25:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:41,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:25:41,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:41,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:41,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,296 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2020-07-29 03:25:41,296 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2020-07-29 03:25:41,513 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2020-07-29 03:25:41,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:41,513 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:41,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. cyclomatic complexity: 7 [2020-07-29 03:25:41,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:41,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:41,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 03:25:41,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:41,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:41,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:41,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2020-07-29 03:25:41,516 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:25:41,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:25:41,517 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 20 transitions. cyclomatic complexity: 7 [2020-07-29 03:25:41,521 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:25:41,522 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 03:25:41,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:41,523 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:41,523 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 25 transitions. cyclomatic complexity: 8 [2020-07-29 03:25:41,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. cyclomatic complexity: 8 [2020-07-29 03:25:41,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:25:41,524 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:25:41,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:41,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:41,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:41,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:41,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:41,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:41,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:41,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:41,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:41,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:25:41,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:25:41,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:25:41,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:41,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:41,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:41,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:25:41,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:25:41,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:25:41,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:25:41,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:25:41,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:25:41,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:41,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:41,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:41,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:41,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:41,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:41,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,533 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 03:25:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2020-07-29 03:25:41,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:41,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:25:41,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:25:41,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:41,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. cyclomatic complexity: 8 [2020-07-29 03:25:41,537 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:25:41,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2020-07-29 03:25:41,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:25:41,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:25:41,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:25:41,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:41,537 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:25:41,537 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:25:41,537 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:25:41,538 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:25:41,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:25:41,538 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:25:41,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:25:41,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:25:41 BoogieIcfgContainer [2020-07-29 03:25:41,545 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:25:41,546 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:25:41,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:25:41,546 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:25:41,546 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:29" (3/4) ... [2020-07-29 03:25:41,552 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:25:41,552 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:25:41,555 INFO L168 Benchmark]: Toolchain (without parser) took 12807.21 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.1 MB). Free memory was 954.9 MB in the beginning and 1.2 GB in the end (delta: -273.6 MB). Peak memory consumption was 116.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:41,556 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:41,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 591.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:41,558 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:41,558 INFO L168 Benchmark]: Boogie Preprocessor took 39.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:41,561 INFO L168 Benchmark]: RCFGBuilder took 558.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:41,564 INFO L168 Benchmark]: BuchiAutomizer took 11546.35 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -135.9 MB). Peak memory consumption was 104.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:41,564 INFO L168 Benchmark]: Witness Printer took 6.44 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:41,574 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 591.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 558.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11546.35 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -135.9 MB). Peak memory consumption was 104.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.44 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length2 and consists of 4 locations. One deterministic module has affine ranking function -1 * s2 + 2 * i and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.4s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 9.5s. Construction of modules took 0.2s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 70 SDtfs, 114 SDslu, 112 SDs, 0 SdLazy, 117 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital196 mio100 ax110 hnf98 lsp84 ukn74 mio100 lsp50 div100 bol100 ite100 ukn100 eq174 hnf89 smp98 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...